25.05/12.65 YES 25.05/12.65 25.12/12.66 Ultimate: Cannot open display: 25.12/12.66 This is Ultimate 0.1.24-8dc7c08-m 25.12/12.66 [2019-03-28 12:44:05,081 INFO L170 SettingsManager]: Resetting all preferences to default values... 25.12/12.66 [2019-03-28 12:44:05,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 25.12/12.66 [2019-03-28 12:44:05,095 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 25.12/12.66 [2019-03-28 12:44:05,095 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 25.12/12.66 [2019-03-28 12:44:05,096 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 25.12/12.66 [2019-03-28 12:44:05,097 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 25.12/12.66 [2019-03-28 12:44:05,099 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 25.12/12.66 [2019-03-28 12:44:05,100 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 25.12/12.66 [2019-03-28 12:44:05,101 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 25.12/12.66 [2019-03-28 12:44:05,102 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 25.12/12.66 [2019-03-28 12:44:05,102 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 25.12/12.66 [2019-03-28 12:44:05,103 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 25.12/12.66 [2019-03-28 12:44:05,104 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 25.12/12.66 [2019-03-28 12:44:05,105 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 25.12/12.66 [2019-03-28 12:44:05,106 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 25.12/12.66 [2019-03-28 12:44:05,106 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 25.12/12.66 [2019-03-28 12:44:05,108 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 25.12/12.66 [2019-03-28 12:44:05,110 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 25.12/12.66 [2019-03-28 12:44:05,111 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 25.12/12.66 [2019-03-28 12:44:05,112 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 25.12/12.66 [2019-03-28 12:44:05,114 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 25.12/12.66 [2019-03-28 12:44:05,116 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 25.12/12.66 [2019-03-28 12:44:05,116 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 25.12/12.66 [2019-03-28 12:44:05,116 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 25.12/12.66 [2019-03-28 12:44:05,117 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 25.12/12.66 [2019-03-28 12:44:05,117 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 25.12/12.66 [2019-03-28 12:44:05,118 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 25.12/12.66 [2019-03-28 12:44:05,118 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 25.12/12.66 [2019-03-28 12:44:05,119 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 25.12/12.66 [2019-03-28 12:44:05,120 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 25.12/12.66 [2019-03-28 12:44:05,121 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 25.12/12.66 [2019-03-28 12:44:05,121 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 25.12/12.66 [2019-03-28 12:44:05,122 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 25.12/12.66 [2019-03-28 12:44:05,122 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 25.12/12.66 [2019-03-28 12:44:05,123 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 25.12/12.66 [2019-03-28 12:44:05,123 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 25.12/12.66 [2019-03-28 12:44:05,124 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 25.12/12.66 [2019-03-28 12:44:05,124 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 25.12/12.66 [2019-03-28 12:44:05,125 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 25.12/12.66 [2019-03-28 12:44:05,139 INFO L110 SettingsManager]: Loading preferences was successful 25.12/12.66 [2019-03-28 12:44:05,140 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 25.12/12.66 [2019-03-28 12:44:05,141 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 25.12/12.66 [2019-03-28 12:44:05,141 INFO L133 SettingsManager]: * Rewrite not-equals=true 25.12/12.66 [2019-03-28 12:44:05,141 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 25.12/12.66 [2019-03-28 12:44:05,141 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 25.12/12.66 [2019-03-28 12:44:05,142 INFO L133 SettingsManager]: * Use SBE=true 25.12/12.66 [2019-03-28 12:44:05,142 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 25.12/12.66 [2019-03-28 12:44:05,142 INFO L133 SettingsManager]: * Use old map elimination=false 25.12/12.66 [2019-03-28 12:44:05,142 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 25.12/12.66 [2019-03-28 12:44:05,142 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 25.12/12.66 [2019-03-28 12:44:05,142 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 25.12/12.66 [2019-03-28 12:44:05,143 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 25.12/12.66 [2019-03-28 12:44:05,143 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 25.12/12.66 [2019-03-28 12:44:05,143 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.12/12.66 [2019-03-28 12:44:05,143 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 25.12/12.66 [2019-03-28 12:44:05,143 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 25.12/12.66 [2019-03-28 12:44:05,144 INFO L133 SettingsManager]: * Check division by zero=IGNORE 25.12/12.66 [2019-03-28 12:44:05,144 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 25.12/12.66 [2019-03-28 12:44:05,144 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 25.12/12.66 [2019-03-28 12:44:05,144 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 25.12/12.66 [2019-03-28 12:44:05,145 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 25.12/12.66 [2019-03-28 12:44:05,145 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 25.12/12.66 [2019-03-28 12:44:05,145 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 25.12/12.66 [2019-03-28 12:44:05,145 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.12/12.66 [2019-03-28 12:44:05,145 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 25.12/12.66 [2019-03-28 12:44:05,146 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 25.12/12.66 [2019-03-28 12:44:05,146 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 25.12/12.66 [2019-03-28 12:44:05,146 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 25.12/12.66 [2019-03-28 12:44:05,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 25.12/12.66 [2019-03-28 12:44:05,197 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 25.12/12.66 [2019-03-28 12:44:05,201 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 25.12/12.66 [2019-03-28 12:44:05,202 INFO L271 PluginConnector]: Initializing CDTParser... 25.12/12.66 [2019-03-28 12:44:05,203 INFO L276 PluginConnector]: CDTParser initialized 25.12/12.66 [2019-03-28 12:44:05,204 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 25.12/12.66 [2019-03-28 12:44:05,282 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/117167fb512c4f19b6075149c500f0b8/FLAG8e58ec674 25.12/12.66 [2019-03-28 12:44:05,810 INFO L307 CDTParser]: Found 1 translation units. 25.12/12.66 [2019-03-28 12:44:05,810 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 25.12/12.66 [2019-03-28 12:44:05,811 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 25.12/12.66 [2019-03-28 12:44:05,817 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/117167fb512c4f19b6075149c500f0b8/FLAG8e58ec674 25.12/12.66 [2019-03-28 12:44:06,211 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/117167fb512c4f19b6075149c500f0b8 25.12/12.66 [2019-03-28 12:44:06,223 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 25.12/12.66 [2019-03-28 12:44:06,224 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 25.12/12.66 [2019-03-28 12:44:06,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 25.12/12.66 [2019-03-28 12:44:06,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 25.12/12.66 [2019-03-28 12:44:06,229 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 25.12/12.66 [2019-03-28 12:44:06,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:06" (1/1) ... 25.12/12.66 [2019-03-28 12:44:06,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf17b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:06, skipping insertion in model container 25.12/12.66 [2019-03-28 12:44:06,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:06" (1/1) ... 25.12/12.66 [2019-03-28 12:44:06,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 25.12/12.66 [2019-03-28 12:44:06,259 INFO L176 MainTranslator]: Built tables and reachable declarations 25.12/12.66 [2019-03-28 12:44:06,421 INFO L206 PostProcessor]: Analyzing one entry point: main 25.12/12.66 [2019-03-28 12:44:06,433 INFO L191 MainTranslator]: Completed pre-run 25.12/12.66 [2019-03-28 12:44:06,507 INFO L206 PostProcessor]: Analyzing one entry point: main 25.12/12.66 [2019-03-28 12:44:06,524 INFO L195 MainTranslator]: Completed translation 25.12/12.66 [2019-03-28 12:44:06,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:06 WrapperNode 25.12/12.66 [2019-03-28 12:44:06,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 25.12/12.66 [2019-03-28 12:44:06,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 25.12/12.66 [2019-03-28 12:44:06,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 25.12/12.66 [2019-03-28 12:44:06,526 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 25.12/12.66 [2019-03-28 12:44:06,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:06" (1/1) ... 25.12/12.66 [2019-03-28 12:44:06,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:06" (1/1) ... 25.12/12.66 [2019-03-28 12:44:06,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 25.12/12.66 [2019-03-28 12:44:06,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 25.12/12.66 [2019-03-28 12:44:06,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 25.12/12.66 [2019-03-28 12:44:06,566 INFO L276 PluginConnector]: Boogie Preprocessor initialized 25.12/12.66 [2019-03-28 12:44:06,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:06" (1/1) ... 25.12/12.66 [2019-03-28 12:44:06,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:06" (1/1) ... 25.12/12.66 [2019-03-28 12:44:06,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:06" (1/1) ... 25.12/12.66 [2019-03-28 12:44:06,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:06" (1/1) ... 25.12/12.66 [2019-03-28 12:44:06,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:06" (1/1) ... 25.12/12.66 [2019-03-28 12:44:06,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:06" (1/1) ... 25.12/12.66 [2019-03-28 12:44:06,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:06" (1/1) ... 25.12/12.66 [2019-03-28 12:44:06,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 25.12/12.66 [2019-03-28 12:44:06,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 25.12/12.66 [2019-03-28 12:44:06,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... 25.12/12.66 [2019-03-28 12:44:06,596 INFO L276 PluginConnector]: RCFGBuilder initialized 25.12/12.66 [2019-03-28 12:44:06,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:06" (1/1) ... 25.12/12.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.12/12.66 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 25.12/12.66 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.12/12.66 [2019-03-28 12:44:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 25.12/12.66 [2019-03-28 12:44:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 25.12/12.66 [2019-03-28 12:44:06,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 25.12/12.66 [2019-03-28 12:44:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 25.12/12.66 [2019-03-28 12:44:06,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 25.12/12.66 [2019-03-28 12:44:06,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 25.12/12.66 [2019-03-28 12:44:06,950 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 25.12/12.66 [2019-03-28 12:44:06,951 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 25.12/12.66 [2019-03-28 12:44:06,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:06 BoogieIcfgContainer 25.12/12.66 [2019-03-28 12:44:06,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 25.12/12.66 [2019-03-28 12:44:06,953 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 25.12/12.66 [2019-03-28 12:44:06,953 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 25.12/12.66 [2019-03-28 12:44:06,957 INFO L276 PluginConnector]: BlockEncodingV2 initialized 25.12/12.66 [2019-03-28 12:44:06,958 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:06" (1/1) ... 25.12/12.66 [2019-03-28 12:44:06,976 INFO L313 BlockEncoder]: Initial Icfg 37 locations, 43 edges 25.12/12.66 [2019-03-28 12:44:06,978 INFO L258 BlockEncoder]: Using Remove infeasible edges 25.12/12.66 [2019-03-28 12:44:06,978 INFO L263 BlockEncoder]: Using Maximize final states 25.12/12.66 [2019-03-28 12:44:06,979 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 25.12/12.66 [2019-03-28 12:44:06,979 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 25.12/12.66 [2019-03-28 12:44:06,981 INFO L296 BlockEncoder]: Using Remove sink states 25.12/12.66 [2019-03-28 12:44:06,982 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 25.12/12.66 [2019-03-28 12:44:06,982 INFO L179 BlockEncoder]: Using Rewrite not-equals 25.12/12.66 [2019-03-28 12:44:07,006 INFO L185 BlockEncoder]: Using Use SBE 25.12/12.66 [2019-03-28 12:44:07,033 INFO L200 BlockEncoder]: SBE split 16 edges 25.12/12.66 [2019-03-28 12:44:07,038 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 25.12/12.66 [2019-03-28 12:44:07,040 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.12/12.66 [2019-03-28 12:44:07,071 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding 25.12/12.66 [2019-03-28 12:44:07,074 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 25.12/12.66 [2019-03-28 12:44:07,075 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 25.12/12.66 [2019-03-28 12:44:07,075 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.12/12.66 [2019-03-28 12:44:07,076 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 25.12/12.66 [2019-03-28 12:44:07,076 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 25.12/12.66 [2019-03-28 12:44:07,077 INFO L313 BlockEncoder]: Encoded RCFG 28 locations, 48 edges 25.12/12.66 [2019-03-28 12:44:07,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:07 BasicIcfg 25.12/12.66 [2019-03-28 12:44:07,077 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 25.12/12.66 [2019-03-28 12:44:07,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 25.12/12.66 [2019-03-28 12:44:07,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... 25.12/12.66 [2019-03-28 12:44:07,083 INFO L276 PluginConnector]: TraceAbstraction initialized 25.12/12.66 [2019-03-28 12:44:07,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:44:06" (1/4) ... 25.12/12.66 [2019-03-28 12:44:07,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a47027d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:07, skipping insertion in model container 25.12/12.66 [2019-03-28 12:44:07,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:06" (2/4) ... 25.12/12.66 [2019-03-28 12:44:07,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a47027d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:07, skipping insertion in model container 25.12/12.66 [2019-03-28 12:44:07,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:06" (3/4) ... 25.12/12.66 [2019-03-28 12:44:07,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a47027d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:07, skipping insertion in model container 25.12/12.66 [2019-03-28 12:44:07,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:07" (4/4) ... 25.12/12.66 [2019-03-28 12:44:07,087 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.12/12.66 [2019-03-28 12:44:07,097 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 25.12/12.66 [2019-03-28 12:44:07,105 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. 25.12/12.66 [2019-03-28 12:44:07,122 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. 25.12/12.66 [2019-03-28 12:44:07,150 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.12/12.66 [2019-03-28 12:44:07,151 INFO L382 AbstractCegarLoop]: Interprodecural is true 25.12/12.66 [2019-03-28 12:44:07,151 INFO L383 AbstractCegarLoop]: Hoare is true 25.12/12.66 [2019-03-28 12:44:07,151 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 25.12/12.66 [2019-03-28 12:44:07,151 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 25.12/12.66 [2019-03-28 12:44:07,152 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.12/12.66 [2019-03-28 12:44:07,152 INFO L387 AbstractCegarLoop]: Difference is false 25.12/12.66 [2019-03-28 12:44:07,152 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 25.12/12.66 [2019-03-28 12:44:07,152 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 25.12/12.66 [2019-03-28 12:44:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. 25.12/12.66 [2019-03-28 12:44:07,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 25.12/12.66 [2019-03-28 12:44:07,173 INFO L394 BasicCegarLoop]: Found error trace 25.12/12.66 [2019-03-28 12:44:07,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 25.12/12.66 [2019-03-28 12:44:07,174 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== 25.12/12.66 [2019-03-28 12:44:07,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:07,180 INFO L82 PathProgramCache]: Analyzing trace with hash 186803813, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:07,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:07,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:07,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:07,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:07,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.12/12.66 [2019-03-28 12:44:07,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.12/12.66 [2019-03-28 12:44:07,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.12/12.66 [2019-03-28 12:44:07,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.12/12.66 [2019-03-28 12:44:07,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.12/12.66 [2019-03-28 12:44:07,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.12/12.66 [2019-03-28 12:44:07,369 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. 25.12/12.66 [2019-03-28 12:44:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.12/12.66 [2019-03-28 12:44:07,489 INFO L93 Difference]: Finished difference Result 28 states and 48 transitions. 25.12/12.66 [2019-03-28 12:44:07,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.12/12.66 [2019-03-28 12:44:07,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 25.12/12.66 [2019-03-28 12:44:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.12/12.66 [2019-03-28 12:44:07,504 INFO L225 Difference]: With dead ends: 28 25.12/12.66 [2019-03-28 12:44:07,504 INFO L226 Difference]: Without dead ends: 21 25.12/12.66 [2019-03-28 12:44:07,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.12/12.66 [2019-03-28 12:44:07,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 25.12/12.66 [2019-03-28 12:44:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 25.12/12.66 [2019-03-28 12:44:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 25.12/12.66 [2019-03-28 12:44:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 34 transitions. 25.12/12.66 [2019-03-28 12:44:07,544 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 34 transitions. Word has length 5 25.12/12.66 [2019-03-28 12:44:07,545 INFO L84 Accepts]: Finished accepts. word is rejected. 25.12/12.66 [2019-03-28 12:44:07,545 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 34 transitions. 25.12/12.66 [2019-03-28 12:44:07,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.12/12.66 [2019-03-28 12:44:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. 25.12/12.66 [2019-03-28 12:44:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 25.12/12.66 [2019-03-28 12:44:07,546 INFO L394 BasicCegarLoop]: Found error trace 25.12/12.66 [2019-03-28 12:44:07,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 25.12/12.66 [2019-03-28 12:44:07,546 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== 25.12/12.66 [2019-03-28 12:44:07,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:07,546 INFO L82 PathProgramCache]: Analyzing trace with hash 186803815, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:07,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:07,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:07,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.12/12.66 [2019-03-28 12:44:07,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.12/12.66 [2019-03-28 12:44:07,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 25.12/12.66 [2019-03-28 12:44:07,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 25.12/12.66 [2019-03-28 12:44:07,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.12/12.66 [2019-03-28 12:44:07,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.12/12.66 [2019-03-28 12:44:07,586 INFO L87 Difference]: Start difference. First operand 21 states and 34 transitions. Second operand 3 states. 25.12/12.66 [2019-03-28 12:44:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.12/12.66 [2019-03-28 12:44:07,699 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. 25.12/12.66 [2019-03-28 12:44:07,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.12/12.66 [2019-03-28 12:44:07,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 25.12/12.66 [2019-03-28 12:44:07,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.12/12.66 [2019-03-28 12:44:07,701 INFO L225 Difference]: With dead ends: 46 25.12/12.66 [2019-03-28 12:44:07,701 INFO L226 Difference]: Without dead ends: 39 25.12/12.66 [2019-03-28 12:44:07,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.12/12.66 [2019-03-28 12:44:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. 25.12/12.66 [2019-03-28 12:44:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. 25.12/12.66 [2019-03-28 12:44:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 25.12/12.66 [2019-03-28 12:44:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 56 transitions. 25.12/12.66 [2019-03-28 12:44:07,710 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 56 transitions. Word has length 5 25.12/12.66 [2019-03-28 12:44:07,711 INFO L84 Accepts]: Finished accepts. word is rejected. 25.12/12.66 [2019-03-28 12:44:07,711 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 56 transitions. 25.12/12.66 [2019-03-28 12:44:07,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 25.12/12.66 [2019-03-28 12:44:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. 25.12/12.66 [2019-03-28 12:44:07,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 25.12/12.66 [2019-03-28 12:44:07,712 INFO L394 BasicCegarLoop]: Found error trace 25.12/12.66 [2019-03-28 12:44:07,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 25.12/12.66 [2019-03-28 12:44:07,712 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== 25.12/12.66 [2019-03-28 12:44:07,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:07,712 INFO L82 PathProgramCache]: Analyzing trace with hash 186803816, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:07,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:07,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:07,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:07,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:07,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.12/12.66 [2019-03-28 12:44:07,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.12/12.66 [2019-03-28 12:44:07,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.12/12.66 [2019-03-28 12:44:07,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.12/12.66 [2019-03-28 12:44:07,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.12/12.66 [2019-03-28 12:44:07,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 25.12/12.66 [2019-03-28 12:44:07,763 INFO L87 Difference]: Start difference. First operand 32 states and 56 transitions. Second operand 4 states. 25.12/12.66 [2019-03-28 12:44:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.12/12.66 [2019-03-28 12:44:07,852 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. 25.12/12.66 [2019-03-28 12:44:07,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.12/12.66 [2019-03-28 12:44:07,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 25.12/12.66 [2019-03-28 12:44:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.12/12.66 [2019-03-28 12:44:07,853 INFO L225 Difference]: With dead ends: 39 25.12/12.66 [2019-03-28 12:44:07,853 INFO L226 Difference]: Without dead ends: 32 25.12/12.66 [2019-03-28 12:44:07,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 25.12/12.66 [2019-03-28 12:44:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 25.12/12.66 [2019-03-28 12:44:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 25.12/12.66 [2019-03-28 12:44:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 25.12/12.66 [2019-03-28 12:44:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. 25.12/12.66 [2019-03-28 12:44:07,859 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 5 25.12/12.66 [2019-03-28 12:44:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. 25.12/12.66 [2019-03-28 12:44:07,859 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. 25.12/12.66 [2019-03-28 12:44:07,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.12/12.66 [2019-03-28 12:44:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. 25.12/12.66 [2019-03-28 12:44:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 25.12/12.66 [2019-03-28 12:44:07,860 INFO L394 BasicCegarLoop]: Found error trace 25.12/12.66 [2019-03-28 12:44:07,860 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 25.12/12.66 [2019-03-28 12:44:07,860 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== 25.12/12.66 [2019-03-28 12:44:07,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:07,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1551395682, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:07,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:07,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:07,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.12/12.66 [2019-03-28 12:44:07,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.12/12.66 [2019-03-28 12:44:07,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.12/12.66 [2019-03-28 12:44:07,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 25.12/12.66 [2019-03-28 12:44:07,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 25.12/12.66 [2019-03-28 12:44:07,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.12/12.66 [2019-03-28 12:44:07,905 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 4 states. 25.12/12.66 [2019-03-28 12:44:07,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.12/12.66 [2019-03-28 12:44:07,975 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. 25.12/12.66 [2019-03-28 12:44:07,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 25.12/12.66 [2019-03-28 12:44:07,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 25.12/12.66 [2019-03-28 12:44:07,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 25.12/12.66 [2019-03-28 12:44:07,976 INFO L225 Difference]: With dead ends: 32 25.12/12.66 [2019-03-28 12:44:07,976 INFO L226 Difference]: Without dead ends: 0 25.12/12.66 [2019-03-28 12:44:07,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 25.12/12.66 [2019-03-28 12:44:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 25.12/12.66 [2019-03-28 12:44:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 25.12/12.66 [2019-03-28 12:44:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 25.12/12.66 [2019-03-28 12:44:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 25.12/12.66 [2019-03-28 12:44:07,978 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 25.12/12.66 [2019-03-28 12:44:07,978 INFO L84 Accepts]: Finished accepts. word is rejected. 25.12/12.66 [2019-03-28 12:44:07,978 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 25.12/12.66 [2019-03-28 12:44:07,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 25.12/12.66 [2019-03-28 12:44:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 25.12/12.66 [2019-03-28 12:44:07,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 25.12/12.66 [2019-03-28 12:44:07,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 25.12/12.66 [2019-03-28 12:44:08,047 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,047 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,047 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,047 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 15) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,047 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,048 INFO L448 ceAbstractionStarter]: For program point L11-1(lines 11 15) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,048 INFO L444 ceAbstractionStarter]: At program point L9-2(lines 9 21) the Hoare annotation is: (and (<= (* 4 ULTIMATE.start_test_fun_~N) (select |#length| ULTIMATE.start_test_fun_~a.base)) (= 0 ULTIMATE.start_test_fun_~a.offset) (<= 0 (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base))) 25.12/12.66 [2019-03-28 12:44:08,048 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,048 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,049 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 26 28) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,049 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,049 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 19) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,049 INFO L448 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,049 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 9 21) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,049 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,049 INFO L448 ceAbstractionStarter]: For program point L16-3(lines 16 19) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,049 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,050 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,050 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,050 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,050 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,050 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,050 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,050 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,051 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,051 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,051 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,051 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 25.12/12.66 [2019-03-28 12:44:08,051 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 25.12/12.66 [2019-03-28 12:44:08,060 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.12/12.66 [2019-03-28 12:44:08,067 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.12/12.66 [2019-03-28 12:44:08,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:08 BasicIcfg 25.12/12.66 [2019-03-28 12:44:08,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 25.12/12.66 [2019-03-28 12:44:08,071 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 25.12/12.66 [2019-03-28 12:44:08,071 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 25.12/12.66 [2019-03-28 12:44:08,074 INFO L276 PluginConnector]: BuchiAutomizer initialized 25.12/12.66 [2019-03-28 12:44:08,075 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.12/12.66 [2019-03-28 12:44:08,098 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:44:06" (1/5) ... 25.12/12.66 [2019-03-28 12:44:08,099 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72583abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:08, skipping insertion in model container 25.12/12.66 [2019-03-28 12:44:08,099 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.12/12.66 [2019-03-28 12:44:08,099 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:06" (2/5) ... 25.12/12.66 [2019-03-28 12:44:08,100 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72583abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:08, skipping insertion in model container 25.12/12.66 [2019-03-28 12:44:08,100 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.12/12.66 [2019-03-28 12:44:08,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:06" (3/5) ... 25.12/12.66 [2019-03-28 12:44:08,100 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72583abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:08, skipping insertion in model container 25.12/12.66 [2019-03-28 12:44:08,100 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.12/12.66 [2019-03-28 12:44:08,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:07" (4/5) ... 25.12/12.66 [2019-03-28 12:44:08,101 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72583abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:08, skipping insertion in model container 25.12/12.66 [2019-03-28 12:44:08,101 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.12/12.66 [2019-03-28 12:44:08,101 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:08" (5/5) ... 25.12/12.66 [2019-03-28 12:44:08,103 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.12/12.66 [2019-03-28 12:44:08,125 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.12/12.66 [2019-03-28 12:44:08,126 INFO L374 BuchiCegarLoop]: Interprodecural is true 25.12/12.66 [2019-03-28 12:44:08,126 INFO L375 BuchiCegarLoop]: Hoare is true 25.12/12.66 [2019-03-28 12:44:08,126 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 25.12/12.66 [2019-03-28 12:44:08,126 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 25.12/12.66 [2019-03-28 12:44:08,126 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.12/12.66 [2019-03-28 12:44:08,126 INFO L379 BuchiCegarLoop]: Difference is false 25.12/12.66 [2019-03-28 12:44:08,126 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 25.12/12.66 [2019-03-28 12:44:08,126 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 25.12/12.66 [2019-03-28 12:44:08,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. 25.12/12.66 [2019-03-28 12:44:08,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 25.12/12.66 [2019-03-28 12:44:08,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.12/12.66 [2019-03-28 12:44:08,137 INFO L119 BuchiIsEmpty]: Starting construction of run 25.12/12.66 [2019-03-28 12:44:08,141 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 25.12/12.66 [2019-03-28 12:44:08,141 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 25.12/12.66 [2019-03-28 12:44:08,142 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 25.12/12.66 [2019-03-28 12:44:08,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. 25.12/12.66 [2019-03-28 12:44:08,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 25.12/12.66 [2019-03-28 12:44:08,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.12/12.66 [2019-03-28 12:44:08,144 INFO L119 BuchiIsEmpty]: Starting construction of run 25.12/12.66 [2019-03-28 12:44:08,145 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 25.12/12.66 [2019-03-28 12:44:08,145 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 25.12/12.66 [2019-03-28 12:44:08,151 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue [168] ULTIMATE.startENTRY-->L26: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_21|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet7, #NULL.base] 19#L26true [116] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 30#L26-2true [137] L26-2-->L9-2: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_test_fun_~i~0_3 0) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1)) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc8.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_3|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, #valid=|v_#valid_5|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~post6, ULTIMATE.start_test_fun_#t~mem1, #valid, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 8#L9-2true 25.12/12.66 [2019-03-28 12:44:08,151 INFO L796 eck$LassoCheckResult]: Loop: 8#L9-2true [83] L9-2-->L11: Formula: (and (= v_ULTIMATE.start_test_fun_~res~0_3 1) (< v_ULTIMATE.start_test_fun_~i~0_7 v_ULTIMATE.start_test_fun_~N_4)) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_3} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~res~0] 25#L11true [106] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_8))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 21#L11-1true [103] L11-1-->L16-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem1_4| 0) (= v_ULTIMATE.start_test_fun_~res~0_4 1)) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_4|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_3|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_4} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_~res~0] 17#L16-2true [94] L16-2-->L16: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~a.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~a.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_test_fun_~a.base_9) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 4#L16true [128] L16-->L16-3: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_4|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 15#L16-3true [173] L16-3-->L9-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_27))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_18))) (and (= (store |v_#memory_int_12| v_ULTIMATE.start_test_fun_~a.base_25 (store (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~a.base_25) .cse0 v_ULTIMATE.start_test_fun_~res~0_11)) |v_#memory_int_11|) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_18 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~a.base_25)) (<= 0 .cse0) (= 1 (select |v_#valid_30| v_ULTIMATE.start_test_fun_~a.base_25)) (= (+ v_ULTIMATE.start_test_fun_~i~0_27 1) v_ULTIMATE.start_test_fun_~i~0_26)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_18, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_25, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_11, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_27} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_18, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_25, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_11, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_26} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 8#L9-2true 25.12/12.66 [2019-03-28 12:44:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:08,152 INFO L82 PathProgramCache]: Analyzing trace with hash 194972, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:08,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:08,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:08,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:08,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:08,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:08,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:08,188 INFO L82 PathProgramCache]: Analyzing trace with hash -930187908, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:08,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:08,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:08,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:08,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:08,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:08,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:08,205 INFO L82 PathProgramCache]: Analyzing trace with hash 907579095, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:08,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:08,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:08,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:08,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:08,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:08,442 INFO L216 LassoAnalysis]: Preferences: 25.12/12.66 [2019-03-28 12:44:08,443 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.12/12.66 [2019-03-28 12:44:08,444 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.12/12.66 [2019-03-28 12:44:08,444 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.12/12.66 [2019-03-28 12:44:08,444 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.12/12.66 [2019-03-28 12:44:08,444 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.12/12.66 [2019-03-28 12:44:08,444 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.12/12.66 [2019-03-28 12:44:08,444 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.12/12.66 [2019-03-28 12:44:08,445 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 25.12/12.66 [2019-03-28 12:44:08,445 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.12/12.66 [2019-03-28 12:44:08,445 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.12/12.66 [2019-03-28 12:44:08,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:08,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:08,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:08,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:08,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:08,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:08,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:08,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:08,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:08,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:08,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:08,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:08,926 INFO L300 LassoAnalysis]: Preprocessing complete. 25.12/12.66 [2019-03-28 12:44:08,931 INFO L497 LassoAnalysis]: Using template 'affine'. 25.12/12.66 [2019-03-28 12:44:08,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:08,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:08,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:08,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:08,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:08,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:08,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:08,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:08,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:08,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:08,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:08,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:08,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:08,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:08,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:08,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:08,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:08,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:08,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:08,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:08,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:08,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:08,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:08,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:08,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:08,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:08,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:08,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:08,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:08,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:08,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:08,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:08,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:08,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:08,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:08,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:08,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:08,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:08,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:08,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:08,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:08,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:08,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:08,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:08,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:08,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:08,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:08,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:08,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:08,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:08,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:08,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:08,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:08,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:08,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:08,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:08,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:08,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:08,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:08,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:08,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:08,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:08,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:08,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:08,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:08,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:08,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:08,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:08,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:08,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:08,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:08,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:08,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:08,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:08,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:08,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:08,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:08,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:09,022 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.12/12.66 [2019-03-28 12:44:09,060 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 25.12/12.66 [2019-03-28 12:44:09,060 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. 25.12/12.66 [2019-03-28 12:44:09,063 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.12/12.66 [2019-03-28 12:44:09,064 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.12/12.66 [2019-03-28 12:44:09,065 INFO L518 LassoAnalysis]: Proved termination. 25.12/12.66 [2019-03-28 12:44:09,065 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.12/12.66 Ranking function f(ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_~i~0, v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1) = -1*ULTIMATE.start_test_fun_~a.offset - 4*ULTIMATE.start_test_fun_~i~0 + 1*v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1 25.12/12.66 Supporting invariants [] 25.12/12.66 [2019-03-28 12:44:09,080 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 25.12/12.66 [2019-03-28 12:44:09,083 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.12/12.66 [2019-03-28 12:44:09,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:09,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core 25.12/12.66 [2019-03-28 12:44:09,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.12/12.66 [2019-03-28 12:44:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:09,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core 25.12/12.66 [2019-03-28 12:44:09,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.12/12.66 [2019-03-28 12:44:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.12/12.66 [2019-03-28 12:44:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:09,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core 25.12/12.66 [2019-03-28 12:44:09,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.12/12.66 [2019-03-28 12:44:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:09,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core 25.12/12.66 [2019-03-28 12:44:09,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.12/12.66 [2019-03-28 12:44:09,292 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 25.12/12.66 [2019-03-28 12:44:09,295 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 25.12/12.66 [2019-03-28 12:44:09,296 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 28 states. Second operand 4 states. 25.12/12.66 [2019-03-28 12:44:09,509 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 28 states.. Second operand 4 states. Result 84 states and 129 transitions. Complement of second has 7 states. 25.12/12.66 [2019-03-28 12:44:09,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 25.12/12.66 [2019-03-28 12:44:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 25.12/12.66 [2019-03-28 12:44:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. 25.12/12.66 [2019-03-28 12:44:09,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 3 letters. Loop has 6 letters. 25.12/12.66 [2019-03-28 12:44:09,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.12/12.66 [2019-03-28 12:44:09,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 9 letters. Loop has 6 letters. 25.12/12.66 [2019-03-28 12:44:09,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.12/12.66 [2019-03-28 12:44:09,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 3 letters. Loop has 12 letters. 25.12/12.66 [2019-03-28 12:44:09,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.12/12.66 [2019-03-28 12:44:09,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 129 transitions. 25.12/12.66 [2019-03-28 12:44:09,529 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 25.12/12.66 [2019-03-28 12:44:09,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 35 states and 50 transitions. 25.12/12.66 [2019-03-28 12:44:09,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 25.12/12.66 [2019-03-28 12:44:09,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 25.12/12.66 [2019-03-28 12:44:09,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 50 transitions. 25.12/12.66 [2019-03-28 12:44:09,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.12/12.66 [2019-03-28 12:44:09,533 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. 25.12/12.66 [2019-03-28 12:44:09,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 50 transitions. 25.12/12.66 [2019-03-28 12:44:09,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. 25.12/12.66 [2019-03-28 12:44:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 25.12/12.66 [2019-03-28 12:44:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. 25.12/12.66 [2019-03-28 12:44:09,537 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. 25.12/12.66 [2019-03-28 12:44:09,538 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. 25.12/12.66 [2019-03-28 12:44:09,538 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 25.12/12.66 [2019-03-28 12:44:09,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. 25.12/12.66 [2019-03-28 12:44:09,539 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 25.12/12.66 [2019-03-28 12:44:09,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.12/12.66 [2019-03-28 12:44:09,539 INFO L119 BuchiIsEmpty]: Starting construction of run 25.12/12.66 [2019-03-28 12:44:09,540 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 25.12/12.66 [2019-03-28 12:44:09,540 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 25.12/12.66 [2019-03-28 12:44:09,540 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY [168] ULTIMATE.startENTRY-->L26: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_21|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet7, #NULL.base] 211#L26 [116] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 212#L26-2 [136] L26-2-->L9-2: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_test_fun_~i~0_3 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1)) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc8.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_3|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, #valid=|v_#valid_5|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~post6, ULTIMATE.start_test_fun_#t~mem1, #valid, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 224#L9-2 25.12/12.66 [2019-03-28 12:44:09,541 INFO L796 eck$LassoCheckResult]: Loop: 224#L9-2 [83] L9-2-->L11: Formula: (and (= v_ULTIMATE.start_test_fun_~res~0_3 1) (< v_ULTIMATE.start_test_fun_~i~0_7 v_ULTIMATE.start_test_fun_~N_4)) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_3} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~res~0] 225#L11 [106] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_8))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 234#L11-1 [103] L11-1-->L16-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem1_4| 0) (= v_ULTIMATE.start_test_fun_~res~0_4 1)) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_4|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_3|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_4} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_~res~0] 241#L16-2 [94] L16-2-->L16: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~a.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~a.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_test_fun_~a.base_9) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 239#L16 [128] L16-->L16-3: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_4|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 237#L16-3 [173] L16-3-->L9-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_27))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_18))) (and (= (store |v_#memory_int_12| v_ULTIMATE.start_test_fun_~a.base_25 (store (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~a.base_25) .cse0 v_ULTIMATE.start_test_fun_~res~0_11)) |v_#memory_int_11|) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_18 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~a.base_25)) (<= 0 .cse0) (= 1 (select |v_#valid_30| v_ULTIMATE.start_test_fun_~a.base_25)) (= (+ v_ULTIMATE.start_test_fun_~i~0_27 1) v_ULTIMATE.start_test_fun_~i~0_26)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_18, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_25, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_11, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_27} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_18, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_25, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_11, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_26} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 224#L9-2 25.12/12.66 [2019-03-28 12:44:09,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:09,541 INFO L82 PathProgramCache]: Analyzing trace with hash 194971, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:09,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:09,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:09,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:09,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:09,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:09,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:09,556 INFO L82 PathProgramCache]: Analyzing trace with hash -930187908, now seen corresponding path program 2 times 25.12/12.66 [2019-03-28 12:44:09,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:09,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:09,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:09,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:09,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:09,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:09,568 INFO L82 PathProgramCache]: Analyzing trace with hash 20075414, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:09,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:09,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:09,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:09,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:09,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:09,731 INFO L216 LassoAnalysis]: Preferences: 25.12/12.66 [2019-03-28 12:44:09,731 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.12/12.66 [2019-03-28 12:44:09,731 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.12/12.66 [2019-03-28 12:44:09,732 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.12/12.66 [2019-03-28 12:44:09,732 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.12/12.66 [2019-03-28 12:44:09,732 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.12/12.66 [2019-03-28 12:44:09,732 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.12/12.66 [2019-03-28 12:44:09,732 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.12/12.66 [2019-03-28 12:44:09,732 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 25.12/12.66 [2019-03-28 12:44:09,732 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.12/12.66 [2019-03-28 12:44:09,733 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.12/12.66 [2019-03-28 12:44:09,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:09,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:09,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:09,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:09,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:09,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:09,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:09,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:09,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:09,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:09,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:09,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:10,078 INFO L300 LassoAnalysis]: Preprocessing complete. 25.12/12.66 [2019-03-28 12:44:10,078 INFO L497 LassoAnalysis]: Using template 'affine'. 25.12/12.66 [2019-03-28 12:44:10,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:10,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:10,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:10,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:10,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:10,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:10,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:10,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:10,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:10,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:10,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:10,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:10,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:10,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:10,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:10,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:10,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:10,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:10,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:10,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:10,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:10,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:10,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:10,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:10,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:10,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:10,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:10,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:10,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:10,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:10,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:10,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:10,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:10,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:10,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:10,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:10,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:10,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:10,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:10,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:10,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:10,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:10,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:10,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:10,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:10,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:10,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:10,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:10,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:10,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:10,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:10,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:10,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:10,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:10,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:10,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:10,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:10,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:10,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:10,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:10,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:10,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:10,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:10,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:10,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:10,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:10,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:10,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:10,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:10,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:10,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:10,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:10,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:10,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:10,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:10,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:10,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:10,135 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.12/12.66 [2019-03-28 12:44:10,149 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 25.12/12.66 [2019-03-28 12:44:10,149 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. 25.12/12.66 [2019-03-28 12:44:10,150 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.12/12.66 [2019-03-28 12:44:10,151 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.12/12.66 [2019-03-28 12:44:10,151 INFO L518 LassoAnalysis]: Proved termination. 25.12/12.66 [2019-03-28 12:44:10,151 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.12/12.66 Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 25.12/12.66 Supporting invariants [] 25.12/12.66 [2019-03-28 12:44:10,158 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 25.12/12.66 [2019-03-28 12:44:10,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:10,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core 25.12/12.66 [2019-03-28 12:44:10,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.12/12.66 [2019-03-28 12:44:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:10,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core 25.12/12.66 [2019-03-28 12:44:10,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.12/12.66 [2019-03-28 12:44:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.12/12.66 [2019-03-28 12:44:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:10,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core 25.12/12.66 [2019-03-28 12:44:10,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.12/12.66 [2019-03-28 12:44:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:10,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core 25.12/12.66 [2019-03-28 12:44:10,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.12/12.66 [2019-03-28 12:44:10,279 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 25.12/12.66 [2019-03-28 12:44:10,279 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 25.12/12.66 [2019-03-28 12:44:10,280 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states and 50 transitions. cyclomatic complexity: 18 Second operand 3 states. 25.12/12.66 [2019-03-28 12:44:10,332 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states and 50 transitions. cyclomatic complexity: 18. Second operand 3 states. Result 46 states and 66 transitions. Complement of second has 4 states. 25.12/12.66 [2019-03-28 12:44:10,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 25.12/12.66 [2019-03-28 12:44:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 25.12/12.66 [2019-03-28 12:44:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. 25.12/12.66 [2019-03-28 12:44:10,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 3 letters. Loop has 6 letters. 25.12/12.66 [2019-03-28 12:44:10,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.12/12.66 [2019-03-28 12:44:10,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 9 letters. Loop has 6 letters. 25.12/12.66 [2019-03-28 12:44:10,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.12/12.66 [2019-03-28 12:44:10,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 3 letters. Loop has 12 letters. 25.12/12.66 [2019-03-28 12:44:10,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.12/12.66 [2019-03-28 12:44:10,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 66 transitions. 25.12/12.66 [2019-03-28 12:44:10,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 25.12/12.66 [2019-03-28 12:44:10,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 65 transitions. 25.12/12.66 [2019-03-28 12:44:10,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 25.12/12.66 [2019-03-28 12:44:10,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 25.12/12.66 [2019-03-28 12:44:10,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 65 transitions. 25.12/12.66 [2019-03-28 12:44:10,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.12/12.66 [2019-03-28 12:44:10,341 INFO L706 BuchiCegarLoop]: Abstraction has 45 states and 65 transitions. 25.12/12.66 [2019-03-28 12:44:10,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 65 transitions. 25.12/12.66 [2019-03-28 12:44:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. 25.12/12.66 [2019-03-28 12:44:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 25.12/12.66 [2019-03-28 12:44:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. 25.12/12.66 [2019-03-28 12:44:10,344 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. 25.12/12.66 [2019-03-28 12:44:10,344 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. 25.12/12.66 [2019-03-28 12:44:10,344 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 25.12/12.66 [2019-03-28 12:44:10,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. 25.12/12.66 [2019-03-28 12:44:10,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 25.12/12.66 [2019-03-28 12:44:10,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.12/12.66 [2019-03-28 12:44:10,345 INFO L119 BuchiIsEmpty]: Starting construction of run 25.12/12.66 [2019-03-28 12:44:10,346 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 25.12/12.66 [2019-03-28 12:44:10,346 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 25.12/12.66 [2019-03-28 12:44:10,347 INFO L794 eck$LassoCheckResult]: Stem: 405#ULTIMATE.startENTRY [168] ULTIMATE.startENTRY-->L26: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_21|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet7, #NULL.base] 384#L26 [116] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 385#L26-2 [137] L26-2-->L9-2: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_test_fun_~i~0_3 0) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1)) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc8.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_3|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, #valid=|v_#valid_5|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~post6, ULTIMATE.start_test_fun_#t~mem1, #valid, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 397#L9-2 [83] L9-2-->L11: Formula: (and (= v_ULTIMATE.start_test_fun_~res~0_3 1) (< v_ULTIMATE.start_test_fun_~i~0_7 v_ULTIMATE.start_test_fun_~N_4)) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_3} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~res~0] 399#L11 [106] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_8))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 401#L11-1 [103] L11-1-->L16-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem1_4| 0) (= v_ULTIMATE.start_test_fun_~res~0_4 1)) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_4|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_3|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_4} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_~res~0] 392#L16-2 25.12/12.66 [2019-03-28 12:44:10,347 INFO L796 eck$LassoCheckResult]: Loop: 392#L16-2 [94] L16-2-->L16: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~a.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~a.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_test_fun_~a.base_9) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 386#L16 [76] L16-->L17: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 387#L17 [172] L17-->L18: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_25))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17))) (and (<= 0 .cse0) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~a.base_24)) (= (* v_ULTIMATE.start_test_fun_~res~0_10 (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~a.base_24) .cse0)) v_ULTIMATE.start_test_fun_~res~0_9) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~a.base_24))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_10, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_9, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~res~0] 395#L18 [174] L18-->L18-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_28))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_19))) (and (= |v_ULTIMATE.start_test_fun_#t~post6_5| |v_ULTIMATE.start_test_fun_#t~mem5_5|) (<= 0 .cse0) (= |v_ULTIMATE.start_test_fun_#t~mem5_5| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~a.base_26) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_19 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~a.base_26)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~a.base_26))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_19, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_26, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_19, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_26, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post6] 391#L18-2 [175] L18-2-->L16-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_29))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_20))) (and (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~a.base_27)) (= (store |v_#memory_int_15| v_ULTIMATE.start_test_fun_~a.base_27 (store (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~a.base_27) .cse0 (+ |v_ULTIMATE.start_test_fun_#t~post6_7| (- 1)))) |v_#memory_int_14|) (<= 0 .cse0) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_20 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~a.base_27))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_20, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_27, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_7|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_29} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_20, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_27, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_29} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post6, #memory_int] 392#L16-2 25.12/12.66 [2019-03-28 12:44:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:10,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1513526708, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:10,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:10,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:10,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:10,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:10,362 INFO L82 PathProgramCache]: Analyzing trace with hash 117875102, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:10,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:10,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:10,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,367 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 25.12/12.66 [2019-03-28 12:44:10,367 INFO L258 seRefinementStrategy]: Advancing trace checker 25.12/12.66 [2019-03-28 12:44:10,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.12/12.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.12/12.66 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 25.12/12.66 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 25.12/12.66 [2019-03-28 12:44:10,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:10,436 INFO L82 PathProgramCache]: Analyzing trace with hash 303604683, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:10,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:10,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:10,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,443 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 25.12/12.66 [2019-03-28 12:44:10,444 INFO L258 seRefinementStrategy]: Advancing trace checker 25.12/12.66 [2019-03-28 12:44:10,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.12/12.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.12/12.66 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 25.12/12.66 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 25.12/12.66 [2019-03-28 12:44:10,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:10,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core 25.12/12.66 [2019-03-28 12:44:10,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.12/12.66 [2019-03-28 12:44:10,612 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 25.12/12.66 [2019-03-28 12:44:10,613 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.12/12.66 [2019-03-28 12:44:10,617 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 25.12/12.66 [2019-03-28 12:44:10,617 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 25.12/12.66 [2019-03-28 12:44:10,618 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 25.12/12.66 [2019-03-28 12:44:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.12/12.66 [2019-03-28 12:44:10,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.12/12.66 [2019-03-28 12:44:10,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 25.12/12.66 [2019-03-28 12:44:10,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.12/12.66 [2019-03-28 12:44:10,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 25.12/12.66 [2019-03-28 12:44:10,717 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. cyclomatic complexity: 13 Second operand 5 states. 25.12/12.66 [2019-03-28 12:44:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.12/12.66 [2019-03-28 12:44:10,788 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. 25.12/12.66 [2019-03-28 12:44:10,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 25.12/12.66 [2019-03-28 12:44:10,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. 25.12/12.66 [2019-03-28 12:44:10,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 25.12/12.66 [2019-03-28 12:44:10,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 29 states and 39 transitions. 25.12/12.66 [2019-03-28 12:44:10,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 25.12/12.66 [2019-03-28 12:44:10,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 25.12/12.66 [2019-03-28 12:44:10,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. 25.12/12.66 [2019-03-28 12:44:10,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.12/12.66 [2019-03-28 12:44:10,795 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. 25.12/12.66 [2019-03-28 12:44:10,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. 25.12/12.66 [2019-03-28 12:44:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. 25.12/12.66 [2019-03-28 12:44:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 25.12/12.66 [2019-03-28 12:44:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. 25.12/12.66 [2019-03-28 12:44:10,798 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. 25.12/12.66 [2019-03-28 12:44:10,798 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. 25.12/12.66 [2019-03-28 12:44:10,798 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 25.12/12.66 [2019-03-28 12:44:10,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. 25.12/12.66 [2019-03-28 12:44:10,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 25.12/12.66 [2019-03-28 12:44:10,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.12/12.66 [2019-03-28 12:44:10,799 INFO L119 BuchiIsEmpty]: Starting construction of run 25.12/12.66 [2019-03-28 12:44:10,800 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.12/12.66 [2019-03-28 12:44:10,800 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 25.12/12.66 [2019-03-28 12:44:10,800 INFO L794 eck$LassoCheckResult]: Stem: 506#ULTIMATE.startENTRY [168] ULTIMATE.startENTRY-->L26: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_21|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet7, #NULL.base] 483#L26 [116] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 484#L26-2 [137] L26-2-->L9-2: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_test_fun_~i~0_3 0) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1)) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc8.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_3|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, #valid=|v_#valid_5|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~post6, ULTIMATE.start_test_fun_#t~mem1, #valid, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 496#L9-2 [83] L9-2-->L11: Formula: (and (= v_ULTIMATE.start_test_fun_~res~0_3 1) (< v_ULTIMATE.start_test_fun_~i~0_7 v_ULTIMATE.start_test_fun_~N_4)) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_3} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~res~0] 498#L11 [106] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_8))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 500#L11-1 [143] L11-1-->L13: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem1_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_6|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 501#L13 [111] L13-->L13-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_10))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_5 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~a.base_6) .cse0)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~a.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_5 .cse1 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~a.base_6)) (<= 0 .cse0)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_5, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_6, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_10} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_5, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_6, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 507#L13-1 [109] L13-1-->L16-2: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem2_4| 0) (= v_ULTIMATE.start_test_fun_~res~0_5 0)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_4|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_~res~0] 490#L16-2 25.12/12.66 [2019-03-28 12:44:10,801 INFO L796 eck$LassoCheckResult]: Loop: 490#L16-2 [94] L16-2-->L16: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~a.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~a.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_test_fun_~a.base_9) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 485#L16 [76] L16-->L17: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 486#L17 [172] L17-->L18: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_25))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17))) (and (<= 0 .cse0) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~a.base_24)) (= (* v_ULTIMATE.start_test_fun_~res~0_10 (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~a.base_24) .cse0)) v_ULTIMATE.start_test_fun_~res~0_9) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~a.base_24))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_10, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_9, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~res~0] 493#L18 [174] L18-->L18-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_28))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_19))) (and (= |v_ULTIMATE.start_test_fun_#t~post6_5| |v_ULTIMATE.start_test_fun_#t~mem5_5|) (<= 0 .cse0) (= |v_ULTIMATE.start_test_fun_#t~mem5_5| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~a.base_26) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_19 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~a.base_26)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~a.base_26))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_19, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_26, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_19, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_26, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post6] 489#L18-2 [175] L18-2-->L16-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_29))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_20))) (and (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~a.base_27)) (= (store |v_#memory_int_15| v_ULTIMATE.start_test_fun_~a.base_27 (store (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~a.base_27) .cse0 (+ |v_ULTIMATE.start_test_fun_#t~post6_7| (- 1)))) |v_#memory_int_14|) (<= 0 .cse0) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_20 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~a.base_27))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_20, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_27, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_7|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_29} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_20, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_27, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_29} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post6, #memory_int] 490#L16-2 25.12/12.66 [2019-03-28 12:44:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1494704966, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:10,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:10,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:10,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.12/12.66 [2019-03-28 12:44:10,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.12/12.66 [2019-03-28 12:44:10,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.12/12.66 [2019-03-28 12:44:10,843 INFO L799 eck$LassoCheckResult]: stem already infeasible 25.12/12.66 [2019-03-28 12:44:10,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:10,844 INFO L82 PathProgramCache]: Analyzing trace with hash 117875102, now seen corresponding path program 2 times 25.12/12.66 [2019-03-28 12:44:10,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:10,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:10,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:10,847 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 25.12/12.66 [2019-03-28 12:44:10,847 INFO L258 seRefinementStrategy]: Advancing trace checker 25.12/12.66 [2019-03-28 12:44:10,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.12/12.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.12/12.66 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 25.12/12.66 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 25.12/12.66 [2019-03-28 12:44:10,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 25.12/12.66 [2019-03-28 12:44:10,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) 25.12/12.66 [2019-03-28 12:44:10,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:10,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.12/12.66 [2019-03-28 12:44:10,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 25.12/12.66 [2019-03-28 12:44:10,951 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. cyclomatic complexity: 12 Second operand 5 states. 25.12/12.66 [2019-03-28 12:44:11,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.12/12.66 [2019-03-28 12:44:11,022 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. 25.12/12.66 [2019-03-28 12:44:11,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 25.12/12.66 [2019-03-28 12:44:11,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. 25.12/12.66 [2019-03-28 12:44:11,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 25.12/12.66 [2019-03-28 12:44:11,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. 25.12/12.66 [2019-03-28 12:44:11,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 25.12/12.66 [2019-03-28 12:44:11,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 25.12/12.66 [2019-03-28 12:44:11,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. 25.12/12.66 [2019-03-28 12:44:11,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.12/12.66 [2019-03-28 12:44:11,028 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. 25.12/12.66 [2019-03-28 12:44:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. 25.12/12.66 [2019-03-28 12:44:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. 25.12/12.66 [2019-03-28 12:44:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 25.12/12.66 [2019-03-28 12:44:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. 25.12/12.66 [2019-03-28 12:44:11,030 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. 25.12/12.66 [2019-03-28 12:44:11,030 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. 25.12/12.66 [2019-03-28 12:44:11,030 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 25.12/12.66 [2019-03-28 12:44:11,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. 25.12/12.66 [2019-03-28 12:44:11,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 25.12/12.66 [2019-03-28 12:44:11,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.12/12.66 [2019-03-28 12:44:11,033 INFO L119 BuchiIsEmpty]: Starting construction of run 25.12/12.66 [2019-03-28 12:44:11,033 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.12/12.66 [2019-03-28 12:44:11,034 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 25.12/12.66 [2019-03-28 12:44:11,034 INFO L794 eck$LassoCheckResult]: Stem: 583#ULTIMATE.startENTRY [168] ULTIMATE.startENTRY-->L26: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_21|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet7, #NULL.base] 560#L26 [116] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 561#L26-2 [137] L26-2-->L9-2: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_test_fun_~i~0_3 0) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1)) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc8.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_3|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, #valid=|v_#valid_5|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~post6, ULTIMATE.start_test_fun_#t~mem1, #valid, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 573#L9-2 [83] L9-2-->L11: Formula: (and (= v_ULTIMATE.start_test_fun_~res~0_3 1) (< v_ULTIMATE.start_test_fun_~i~0_7 v_ULTIMATE.start_test_fun_~N_4)) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_3} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~res~0] 575#L11 [106] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_8))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 577#L11-1 [143] L11-1-->L13: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem1_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_6|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 578#L13 [111] L13-->L13-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_10))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_5 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~a.base_6) .cse0)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~a.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_5 .cse1 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~a.base_6)) (<= 0 .cse0)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_5, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_6, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_10} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_5, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_6, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 584#L13-1 [129] L13-1-->L16-2: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem2_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 567#L16-2 25.12/12.66 [2019-03-28 12:44:11,035 INFO L796 eck$LassoCheckResult]: Loop: 567#L16-2 [94] L16-2-->L16: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~a.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~a.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_test_fun_~a.base_9) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 562#L16 [76] L16-->L17: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 563#L17 [172] L17-->L18: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_25))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17))) (and (<= 0 .cse0) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~a.base_24)) (= (* v_ULTIMATE.start_test_fun_~res~0_10 (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~a.base_24) .cse0)) v_ULTIMATE.start_test_fun_~res~0_9) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~a.base_24))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_10, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_9, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~res~0] 570#L18 [174] L18-->L18-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_28))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_19))) (and (= |v_ULTIMATE.start_test_fun_#t~post6_5| |v_ULTIMATE.start_test_fun_#t~mem5_5|) (<= 0 .cse0) (= |v_ULTIMATE.start_test_fun_#t~mem5_5| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~a.base_26) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_19 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~a.base_26)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~a.base_26))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_19, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_26, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_19, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_26, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post6] 566#L18-2 [175] L18-2-->L16-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_29))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_20))) (and (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~a.base_27)) (= (store |v_#memory_int_15| v_ULTIMATE.start_test_fun_~a.base_27 (store (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~a.base_27) .cse0 (+ |v_ULTIMATE.start_test_fun_#t~post6_7| (- 1)))) |v_#memory_int_14|) (<= 0 .cse0) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_20 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~a.base_27))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_20, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_27, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_7|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_29} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_20, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_27, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_29} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post6, #memory_int] 567#L16-2 25.12/12.66 [2019-03-28 12:44:11,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:11,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1494704946, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:11,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:11,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:11,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:11,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:11,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:11,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:11,052 INFO L82 PathProgramCache]: Analyzing trace with hash 117875102, now seen corresponding path program 3 times 25.12/12.66 [2019-03-28 12:44:11,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:11,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:11,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:11,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:11,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:11,056 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 25.12/12.66 [2019-03-28 12:44:11,056 INFO L258 seRefinementStrategy]: Advancing trace checker 25.12/12.66 [2019-03-28 12:44:11,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.12/12.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.12/12.66 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 25.12/12.66 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 25.12/12.66 [2019-03-28 12:44:11,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 25.12/12.66 [2019-03-28 12:44:11,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) 25.12/12.66 [2019-03-28 12:44:11,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:11,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:11,139 INFO L82 PathProgramCache]: Analyzing trace with hash 49347825, now seen corresponding path program 1 times 25.12/12.66 [2019-03-28 12:44:11,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.12/12.66 [2019-03-28 12:44:11,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.12/12.66 [2019-03-28 12:44:11,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:11,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:11,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:11,145 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 25.12/12.66 [2019-03-28 12:44:11,145 INFO L258 seRefinementStrategy]: Advancing trace checker 25.12/12.66 [2019-03-28 12:44:11,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 25.12/12.66 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.12/12.66 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 25.12/12.66 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 25.12/12.66 [2019-03-28 12:44:11,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.12/12.66 [2019-03-28 12:44:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:11,430 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 25.12/12.66 [2019-03-28 12:44:11,489 INFO L216 LassoAnalysis]: Preferences: 25.12/12.66 [2019-03-28 12:44:11,489 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.12/12.66 [2019-03-28 12:44:11,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.12/12.66 [2019-03-28 12:44:11,490 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.12/12.66 [2019-03-28 12:44:11,490 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.12/12.66 [2019-03-28 12:44:11,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.12/12.66 [2019-03-28 12:44:11,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.12/12.66 [2019-03-28 12:44:11,490 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.12/12.66 [2019-03-28 12:44:11,490 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 25.12/12.66 [2019-03-28 12:44:11,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.12/12.66 [2019-03-28 12:44:11,491 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.12/12.66 [2019-03-28 12:44:11,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:11,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:11,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:11,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:11,620 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 25.12/12.66 [2019-03-28 12:44:11,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:11,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:11,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:11,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:11,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:11,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:11,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:11,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.12/12.66 [2019-03-28 12:44:11,922 INFO L300 LassoAnalysis]: Preprocessing complete. 25.12/12.66 [2019-03-28 12:44:11,922 INFO L497 LassoAnalysis]: Using template 'affine'. 25.12/12.66 [2019-03-28 12:44:11,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:11,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:11,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:11,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:11,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:11,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:11,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:11,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:11,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:11,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:11,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:11,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.12/12.66 [2019-03-28 12:44:11,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:11,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:11,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:11,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:11,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:11,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:11,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:11,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:11,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:11,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:11,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:11,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:11,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:11,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:11,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:11,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:11,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:11,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:11,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:11,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:11,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:11,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:11,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:11,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:11,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:11,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:11,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:11,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:11,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:11,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:11,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:11,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:11,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:11,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:11,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:11,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:11,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:11,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.12/12.66 [2019-03-28 12:44:11,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.12/12.66 Termination analysis: LINEAR_WITH_GUESSES 25.12/12.66 Number of strict supporting invariants: 0 25.12/12.66 Number of non-strict supporting invariants: 1 25.12/12.66 Consider only non-deceasing supporting invariants: true 25.12/12.66 Simplify termination arguments: true 25.12/12.66 Simplify supporting invariants: trueOverapproximate stem: false 25.12/12.66 [2019-03-28 12:44:11,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.12/12.66 [2019-03-28 12:44:11,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.12/12.66 [2019-03-28 12:44:11,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.12/12.66 [2019-03-28 12:44:11,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.12/12.66 [2019-03-28 12:44:11,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 25.12/12.66 [2019-03-28 12:44:11,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 25.12/12.66 [2019-03-28 12:44:11,973 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.12/12.66 [2019-03-28 12:44:11,976 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.12/12.66 [2019-03-28 12:44:11,976 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. 25.12/12.66 [2019-03-28 12:44:11,977 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.12/12.66 [2019-03-28 12:44:11,978 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 25.12/12.66 [2019-03-28 12:44:11,978 INFO L518 LassoAnalysis]: Proved termination. 25.12/12.66 [2019-03-28 12:44:11,978 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.12/12.66 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2 25.12/12.66 Supporting invariants [] 25.12/12.66 [2019-03-28 12:44:11,985 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 25.12/12.66 [2019-03-28 12:44:11,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 25.12/12.66 [2019-03-28 12:44:12,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.12/12.66 [2019-03-28 12:44:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:12,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core 25.12/12.66 [2019-03-28 12:44:12,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.12/12.66 [2019-03-28 12:44:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:12,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core 25.12/12.66 [2019-03-28 12:44:12,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.12/12.66 [2019-03-28 12:44:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.12/12.66 [2019-03-28 12:44:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.12/12.66 [2019-03-28 12:44:12,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core 25.12/12.66 [2019-03-28 12:44:12,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.12/12.66 [2019-03-28 12:44:12,168 INFO L340 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size 25.12/12.66 [2019-03-28 12:44:12,169 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 36 25.12/12.66 [2019-03-28 12:44:12,170 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 25.12/12.66 [2019-03-28 12:44:12,180 INFO L497 ElimStorePlain]: treesize reduction 13, result has 56.7 percent of original size 25.12/12.66 [2019-03-28 12:44:12,181 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 25.12/12.66 [2019-03-28 12:44:12,181 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:13 25.12/12.66 [2019-03-28 12:44:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.12/12.66 [2019-03-28 12:44:12,240 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 25.12/12.66 [2019-03-28 12:44:12,240 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization 25.12/12.66 [2019-03-28 12:44:12,241 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 25.12/12.66 [2019-03-28 12:44:12,241 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 28 states and 36 transitions. cyclomatic complexity: 10 Second operand 5 states. 25.12/12.66 [2019-03-28 12:44:12,293 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 28 states and 36 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 42 states and 52 transitions. Complement of second has 10 states. 25.12/12.66 [2019-03-28 12:44:12,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 25.12/12.66 [2019-03-28 12:44:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 25.12/12.66 [2019-03-28 12:44:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. 25.12/12.66 [2019-03-28 12:44:12,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 5 letters. 25.12/12.66 [2019-03-28 12:44:12,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.12/12.66 [2019-03-28 12:44:12,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 13 letters. Loop has 5 letters. 25.12/12.66 [2019-03-28 12:44:12,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.12/12.66 [2019-03-28 12:44:12,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 10 letters. 25.12/12.66 [2019-03-28 12:44:12,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.12/12.66 [2019-03-28 12:44:12,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. 25.12/12.66 [2019-03-28 12:44:12,300 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.12/12.66 [2019-03-28 12:44:12,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. 25.12/12.66 [2019-03-28 12:44:12,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 25.12/12.66 [2019-03-28 12:44:12,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 25.12/12.66 [2019-03-28 12:44:12,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 25.12/12.66 [2019-03-28 12:44:12,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.12/12.66 [2019-03-28 12:44:12,301 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.12/12.66 [2019-03-28 12:44:12,301 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.12/12.66 [2019-03-28 12:44:12,301 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.12/12.66 [2019-03-28 12:44:12,301 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 25.12/12.66 [2019-03-28 12:44:12,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 25.12/12.66 [2019-03-28 12:44:12,301 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.12/12.66 [2019-03-28 12:44:12,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 25.12/12.66 [2019-03-28 12:44:12,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:12 BasicIcfg 25.12/12.66 [2019-03-28 12:44:12,307 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 25.12/12.66 [2019-03-28 12:44:12,308 INFO L168 Benchmark]: Toolchain (without parser) took 6084.57 ms. Allocated memory was 645.4 MB in the beginning and 768.6 MB in the end (delta: 123.2 MB). Free memory was 561.2 MB in the beginning and 511.2 MB in the end (delta: 50.0 MB). Peak memory consumption was 173.2 MB. Max. memory is 50.3 GB. 25.12/12.66 [2019-03-28 12:44:12,309 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 645.4 MB. Free memory is still 580.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.12/12.66 [2019-03-28 12:44:12,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.96 ms. Allocated memory was 645.4 MB in the beginning and 672.7 MB in the end (delta: 27.3 MB). Free memory was 560.2 MB in the beginning and 637.6 MB in the end (delta: -77.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 25.12/12.66 [2019-03-28 12:44:12,310 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.13 ms. Allocated memory is still 672.7 MB. Free memory was 637.6 MB in the beginning and 635.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 50.3 GB. 25.12/12.66 [2019-03-28 12:44:12,310 INFO L168 Benchmark]: Boogie Preprocessor took 29.18 ms. Allocated memory is still 672.7 MB. Free memory was 635.5 MB in the beginning and 634.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 25.12/12.66 [2019-03-28 12:44:12,311 INFO L168 Benchmark]: RCFGBuilder took 356.77 ms. Allocated memory is still 672.7 MB. Free memory was 634.4 MB in the beginning and 612.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 50.3 GB. 25.12/12.66 [2019-03-28 12:44:12,311 INFO L168 Benchmark]: BlockEncodingV2 took 124.99 ms. Allocated memory is still 672.7 MB. Free memory was 612.5 MB in the beginning and 602.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 25.12/12.66 [2019-03-28 12:44:12,312 INFO L168 Benchmark]: TraceAbstraction took 991.81 ms. Allocated memory is still 672.7 MB. Free memory was 601.7 MB in the beginning and 505.4 MB in the end (delta: 96.3 MB). Peak memory consumption was 96.3 MB. Max. memory is 50.3 GB. 25.12/12.66 [2019-03-28 12:44:12,312 INFO L168 Benchmark]: BuchiAutomizer took 4236.58 ms. Allocated memory was 672.7 MB in the beginning and 768.6 MB in the end (delta: 95.9 MB). Free memory was 505.4 MB in the beginning and 511.2 MB in the end (delta: -5.8 MB). Peak memory consumption was 90.1 MB. Max. memory is 50.3 GB. 25.12/12.66 [2019-03-28 12:44:12,317 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 25.12/12.66 --- Results --- 25.12/12.66 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 25.12/12.66 - StatisticsResult: Initial Icfg 25.12/12.66 37 locations, 43 edges 25.12/12.66 - StatisticsResult: Encoded RCFG 25.12/12.66 28 locations, 48 edges 25.12/12.66 * Results from de.uni_freiburg.informatik.ultimate.core: 25.12/12.66 - StatisticsResult: Toolchain Benchmarks 25.12/12.66 Benchmark results are: 25.12/12.66 * CDTParser took 0.16 ms. Allocated memory is still 645.4 MB. Free memory is still 580.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.12/12.66 * CACSL2BoogieTranslator took 299.96 ms. Allocated memory was 645.4 MB in the beginning and 672.7 MB in the end (delta: 27.3 MB). Free memory was 560.2 MB in the beginning and 637.6 MB in the end (delta: -77.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 25.12/12.66 * Boogie Procedure Inliner took 40.13 ms. Allocated memory is still 672.7 MB. Free memory was 637.6 MB in the beginning and 635.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 50.3 GB. 25.12/12.66 * Boogie Preprocessor took 29.18 ms. Allocated memory is still 672.7 MB. Free memory was 635.5 MB in the beginning and 634.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 25.12/12.66 * RCFGBuilder took 356.77 ms. Allocated memory is still 672.7 MB. Free memory was 634.4 MB in the beginning and 612.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 50.3 GB. 25.12/12.66 * BlockEncodingV2 took 124.99 ms. Allocated memory is still 672.7 MB. Free memory was 612.5 MB in the beginning and 602.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 25.12/12.66 * TraceAbstraction took 991.81 ms. Allocated memory is still 672.7 MB. Free memory was 601.7 MB in the beginning and 505.4 MB in the end (delta: 96.3 MB). Peak memory consumption was 96.3 MB. Max. memory is 50.3 GB. 25.12/12.66 * BuchiAutomizer took 4236.58 ms. Allocated memory was 672.7 MB in the beginning and 768.6 MB in the end (delta: 95.9 MB). Free memory was 505.4 MB in the beginning and 511.2 MB in the end (delta: -5.8 MB). Peak memory consumption was 90.1 MB. Max. memory is 50.3 GB. 25.12/12.66 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 25.12/12.66 - GenericResult: Unfinished Backtranslation 25.12/12.66 unknown boogie variable #length 25.12/12.66 - GenericResult: Unfinished Backtranslation 25.12/12.66 unknown boogie variable #length 25.12/12.66 - GenericResult: Unfinished Backtranslation 25.12/12.66 unknown boogie variable #length 25.12/12.66 - GenericResult: Unfinished Backtranslation 25.12/12.66 unknown boogie variable #memory_int 25.12/12.66 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 25.12/12.66 - PositiveResult [Line: 18]: pointer dereference always succeeds 25.12/12.66 For all program executions holds that pointer dereference always succeeds at this location 25.12/12.66 - PositiveResult [Line: 17]: pointer dereference always succeeds 25.12/12.66 For all program executions holds that pointer dereference always succeeds at this location 25.12/12.66 - PositiveResult [Line: 17]: pointer dereference always succeeds 25.12/12.66 For all program executions holds that pointer dereference always succeeds at this location 25.12/12.66 - PositiveResult [Line: 16]: pointer dereference always succeeds 25.12/12.66 For all program executions holds that pointer dereference always succeeds at this location 25.12/12.66 - PositiveResult [Line: 16]: pointer dereference always succeeds 25.12/12.66 For all program executions holds that pointer dereference always succeeds at this location 25.12/12.66 - PositiveResult [Line: 13]: pointer dereference always succeeds 25.12/12.66 For all program executions holds that pointer dereference always succeeds at this location 25.12/12.66 - PositiveResult [Line: 13]: pointer dereference always succeeds 25.12/12.66 For all program executions holds that pointer dereference always succeeds at this location 25.12/12.66 - PositiveResult [Line: 20]: pointer dereference always succeeds 25.12/12.66 For all program executions holds that pointer dereference always succeeds at this location 25.12/12.66 - PositiveResult [Line: 20]: pointer dereference always succeeds 25.12/12.66 For all program executions holds that pointer dereference always succeeds at this location 25.12/12.66 - PositiveResult [Line: 11]: pointer dereference always succeeds 25.12/12.66 For all program executions holds that pointer dereference always succeeds at this location 25.12/12.66 - PositiveResult [Line: 11]: pointer dereference always succeeds 25.12/12.66 For all program executions holds that pointer dereference always succeeds at this location 25.12/12.66 - PositiveResult [Line: 18]: pointer dereference always succeeds 25.12/12.66 For all program executions holds that pointer dereference always succeeds at this location 25.12/12.66 - PositiveResult [Line: 18]: pointer dereference always succeeds 25.12/12.66 For all program executions holds that pointer dereference always succeeds at this location 25.12/12.66 - PositiveResult [Line: 18]: pointer dereference always succeeds 25.12/12.66 For all program executions holds that pointer dereference always succeeds at this location 25.12/12.66 - AllSpecificationsHoldResult: All specifications hold 25.12/12.66 14 specifications checked. All of them hold 25.12/12.66 - InvariantResult [Line: 9]: Loop Invariant 25.12/12.66 [2019-03-28 12:44:12,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.12/12.66 [2019-03-28 12:44:12,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 25.12/12.66 Derived loop invariant: ((4 * N <= unknown-#length-unknown[a] && 0 == a) && 0 <= 4 * i + a) && 1 == \valid[a] 25.12/12.66 - StatisticsResult: Ultimate Automizer benchmark data 25.12/12.66 CFG has 1 procedures, 28 locations, 14 error locations. SAFE Result, 0.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 112 SDslu, 28 SDs, 0 SdLazy, 154 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 23 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 676 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 25.12/12.66 - StatisticsResult: Constructed decomposition of program 25.12/12.66 Your program was decomposed into 5 terminating modules (2 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function -1 * a + -4 * i + unknown-#length-unknown[a] and consists of 5 locations. One nondeterministic module has affine ranking function N + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. 25.12/12.66 - StatisticsResult: Timing statistics 25.12/12.66 BüchiAutomizer plugin needed 4.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 63 SDtfs, 196 SDslu, 79 SDs, 0 SdLazy, 351 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax100 hnf100 lsp95 ukn75 mio100 lsp57 div100 bol100 ite100 ukn100 eq177 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 25.12/12.66 - TerminationAnalysisResult: Termination proven 25.12/12.66 Buchi Automizer proved that your program is terminating 25.12/12.66 RESULT: Ultimate proved your program to be correct! 25.12/12.66 !SESSION 2019-03-28 12:44:01.481 ----------------------------------------------- 25.12/12.66 eclipse.buildId=unknown 25.12/12.66 java.version=1.8.0_181 25.12/12.66 java.vendor=Oracle Corporation 25.12/12.66 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 25.12/12.66 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 25.12/12.66 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 25.12/12.66 25.12/12.66 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:44:12.553 25.12/12.66 !MESSAGE The workspace will exit with unsaved changes in this session. 25.12/12.66 Received shutdown request... 25.12/12.66 Ultimate: 25.12/12.66 GTK+ Version Check 25.12/12.66 EOF