./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sum05_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sum05_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 48db2505a59cdca75fbfbfb4403b26f347fcdcda ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:27:25,430 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:27:25,431 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:27:25,437 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:27:25,437 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:27:25,438 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:27:25,438 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:27:25,439 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:27:25,440 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:27:25,440 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:27:25,441 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:27:25,441 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:27:25,441 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:27:25,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:27:25,442 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:27:25,442 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:27:25,443 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:27:25,444 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:27:25,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:27:25,445 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:27:25,446 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:27:25,446 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:27:25,447 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:27:25,447 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:27:25,447 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:27:25,448 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:27:25,448 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:27:25,449 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:27:25,449 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:27:25,449 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:27:25,449 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:27:25,450 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:27:25,450 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:27:25,450 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:27:25,450 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:27:25,451 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:27:25,451 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 00:27:25,458 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:27:25,458 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:27:25,459 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:27:25,459 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:27:25,459 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:27:25,459 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 00:27:25,459 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 00:27:25,460 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 00:27:25,460 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 00:27:25,460 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 00:27:25,460 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 00:27:25,460 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:27:25,460 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:27:25,460 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:27:25,460 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:27:25,460 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:27:25,460 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:27:25,460 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 00:27:25,460 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 00:27:25,461 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 00:27:25,461 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:27:25,461 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:27:25,461 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 00:27:25,461 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:27:25,461 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 00:27:25,461 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:27:25,461 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:27:25,461 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 00:27:25,461 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:27:25,461 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:27:25,462 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 00:27:25,462 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 00:27:25,462 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 48db2505a59cdca75fbfbfb4403b26f347fcdcda [2018-12-09 00:27:25,478 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:27:25,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:27:25,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:27:25,488 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:27:25,488 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:27:25,488 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/sum05_true-unreach-call_true-termination.i [2018-12-09 00:27:25,523 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/data/4d0a865c0/efdb9d4e50bc450998d5eda7e00eb341/FLAGe107143a2 [2018-12-09 00:27:25,916 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:27:25,916 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/sv-benchmarks/c/reducercommutativity/sum05_true-unreach-call_true-termination.i [2018-12-09 00:27:25,919 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/data/4d0a865c0/efdb9d4e50bc450998d5eda7e00eb341/FLAGe107143a2 [2018-12-09 00:27:25,927 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/data/4d0a865c0/efdb9d4e50bc450998d5eda7e00eb341 [2018-12-09 00:27:25,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:27:25,930 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:27:25,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:27:25,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:27:25,932 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:27:25,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:27:25" (1/1) ... [2018-12-09 00:27:25,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4857c57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:25, skipping insertion in model container [2018-12-09 00:27:25,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:27:25" (1/1) ... [2018-12-09 00:27:25,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:27:25,948 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:27:26,037 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:27:26,043 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:27:26,055 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:27:26,063 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:27:26,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:26 WrapperNode [2018-12-09 00:27:26,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:27:26,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:27:26,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:27:26,064 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:27:26,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:26" (1/1) ... [2018-12-09 00:27:26,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:26" (1/1) ... [2018-12-09 00:27:26,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:27:26,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:27:26,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:27:26,117 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:27:26,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:26" (1/1) ... [2018-12-09 00:27:26,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:26" (1/1) ... [2018-12-09 00:27:26,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:26" (1/1) ... [2018-12-09 00:27:26,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:26" (1/1) ... [2018-12-09 00:27:26,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:26" (1/1) ... [2018-12-09 00:27:26,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:26" (1/1) ... [2018-12-09 00:27:26,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:26" (1/1) ... [2018-12-09 00:27:26,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:27:26,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:27:26,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:27:26,138 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:27:26,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:27:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:27:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:27:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:27:26,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:27:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 00:27:26,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:27:26,301 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:27:26,301 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-12-09 00:27:26,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:27:26 BoogieIcfgContainer [2018-12-09 00:27:26,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:27:26,302 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 00:27:26,302 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 00:27:26,304 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 00:27:26,305 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:27:26,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 12:27:25" (1/3) ... [2018-12-09 00:27:26,306 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@758bcd1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:27:26, skipping insertion in model container [2018-12-09 00:27:26,306 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:27:26,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:26" (2/3) ... [2018-12-09 00:27:26,306 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@758bcd1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:27:26, skipping insertion in model container [2018-12-09 00:27:26,306 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:27:26,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:27:26" (3/3) ... [2018-12-09 00:27:26,308 INFO L375 chiAutomizerObserver]: Analyzing ICFG sum05_true-unreach-call_true-termination.i [2018-12-09 00:27:26,340 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:27:26,340 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 00:27:26,341 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 00:27:26,341 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 00:27:26,341 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:27:26,341 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:27:26,341 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 00:27:26,341 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:27:26,341 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 00:27:26,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-09 00:27:26,365 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-09 00:27:26,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:26,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:26,369 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 00:27:26,369 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:26,370 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 00:27:26,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-09 00:27:26,371 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-09 00:27:26,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:26,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:26,371 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 00:27:26,371 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:26,376 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 26#L23-3true [2018-12-09 00:27:26,376 INFO L796 eck$LassoCheckResult]: Loop: 26#L23-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 9#L23-2true main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26#L23-3true [2018-12-09 00:27:26,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:26,380 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 00:27:26,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:26,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:26,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:26,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:26,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:26,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:26,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-12-09 00:27:26,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:26,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:26,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:26,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:26,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:26,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:26,455 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-12-09 00:27:26,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:26,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:26,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:26,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:26,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:26,557 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:27:26,558 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:27:26,558 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:27:26,559 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:27:26,559 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:27:26,559 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:27:26,559 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:27:26,559 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:27:26,559 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum05_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-09 00:27:26,559 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:27:26,559 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:27:26,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:26,740 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:27:26,743 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:27:26,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:27:26,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:27:26,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:27:26,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:27:26,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,801 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:27:26,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,802 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:27:26,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:27:26,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:27:26,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:27:26,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:26,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:26,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:26,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:27:26,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:27:26,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:26,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:26,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:26,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:26,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:26,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:26,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:27:26,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:27:26,839 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:27:26,852 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:27:26,852 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:27:26,854 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:27:26,855 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:27:26,856 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:27:26,856 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 9 Supporting invariants [] [2018-12-09 00:27:26,859 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-09 00:27:26,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:26,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:27:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:26,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:27:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:27:26,927 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 00:27:26,927 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2018-12-09 00:27:26,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 69 states and 95 transitions. Complement of second has 7 states. [2018-12-09 00:27:26,957 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 [2018-12-09 00:27:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:27:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-12-09 00:27:26,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-09 00:27:26,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:27:26,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-09 00:27:26,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:27:26,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-09 00:27:26,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:27:26,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 95 transitions. [2018-12-09 00:27:26,963 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:27:26,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 19 states and 24 transitions. [2018-12-09 00:27:26,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-09 00:27:26,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 00:27:26,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2018-12-09 00:27:26,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:27:26,967 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-09 00:27:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2018-12-09 00:27:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-09 00:27:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-09 00:27:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-09 00:27:26,984 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-09 00:27:26,984 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-09 00:27:26,984 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 00:27:26,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-12-09 00:27:26,985 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:27:26,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:26,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:26,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 00:27:26,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:26,985 INFO L794 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 150#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 147#L23-3 assume !(main_~i~1 < 5); 146#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 139#L9-3 [2018-12-09 00:27:26,985 INFO L796 eck$LassoCheckResult]: Loop: 139#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 140#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 139#L9-3 [2018-12-09 00:27:26,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:26,986 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-12-09 00:27:26,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:26,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:26,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:26,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:26,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:27:27,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:27,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:27:27,012 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:27:27,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:27,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2018-12-09 00:27:27,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:27,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:27,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:27,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:27:27,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:27:27,037 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-09 00:27:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:27,045 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-12-09 00:27:27,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:27:27,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-12-09 00:27:27,046 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:27:27,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2018-12-09 00:27:27,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-09 00:27:27,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 00:27:27,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-12-09 00:27:27,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:27:27,048 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-12-09 00:27:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-12-09 00:27:27,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-12-09 00:27:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-09 00:27:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-12-09 00:27:27,050 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-09 00:27:27,050 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-09 00:27:27,050 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 00:27:27,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-12-09 00:27:27,051 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:27:27,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:27,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:27,051 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 00:27:27,051 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:27,052 INFO L794 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 195#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 192#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 193#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 194#L23-3 assume !(main_~i~1 < 5); 191#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 184#L9-3 [2018-12-09 00:27:27,052 INFO L796 eck$LassoCheckResult]: Loop: 184#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 185#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 184#L9-3 [2018-12-09 00:27:27,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:27,052 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-12-09 00:27:27,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:27,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:27,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:27,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:27:27,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:27:27,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:27:27,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:27,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:27:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:27:27,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:27:27,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-09 00:27:27,107 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:27:27,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:27,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2018-12-09 00:27:27,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:27,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:27,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:27,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:27:27,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:27:27,139 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-09 00:27:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:27,150 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-12-09 00:27:27,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:27:27,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2018-12-09 00:27:27,151 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:27:27,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2018-12-09 00:27:27,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-09 00:27:27,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 00:27:27,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-12-09 00:27:27,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:27:27,152 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-12-09 00:27:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-12-09 00:27:27,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-09 00:27:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 00:27:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-09 00:27:27,153 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-09 00:27:27,154 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-09 00:27:27,154 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 00:27:27,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-12-09 00:27:27,154 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:27:27,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:27,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:27,154 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-12-09 00:27:27,154 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:27,155 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 260#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 256#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 257#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 258#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 259#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 266#L23-3 assume !(main_~i~1 < 5); 255#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 248#L9-3 [2018-12-09 00:27:27,155 INFO L796 eck$LassoCheckResult]: Loop: 248#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 249#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 248#L9-3 [2018-12-09 00:27:27,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:27,155 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-12-09 00:27:27,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:27,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:27,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:27,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:27:27,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:27:27,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:27:27,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:27:27,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:27:27,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:27:27,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:27:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:27:27,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:27:27,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-09 00:27:27,228 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:27:27,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:27,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2018-12-09 00:27:27,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:27,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:27,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:27,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:27:27,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:27:27,255 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-12-09 00:27:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:27,268 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-12-09 00:27:27,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:27:27,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-12-09 00:27:27,269 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:27:27,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2018-12-09 00:27:27,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-09 00:27:27,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 00:27:27,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-12-09 00:27:27,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:27:27,269 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-09 00:27:27,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-12-09 00:27:27,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-09 00:27:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-09 00:27:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-09 00:27:27,271 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-09 00:27:27,271 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-09 00:27:27,271 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 00:27:27,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-12-09 00:27:27,271 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:27:27,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:27,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:27,272 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-12-09 00:27:27,272 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:27,272 INFO L794 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 335#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 331#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 332#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 333#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 334#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 343#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 342#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 341#L23-3 assume !(main_~i~1 < 5); 330#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 323#L9-3 [2018-12-09 00:27:27,272 INFO L796 eck$LassoCheckResult]: Loop: 323#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 324#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 323#L9-3 [2018-12-09 00:27:27,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:27,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-12-09 00:27:27,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:27,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:27,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:27,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:27:27,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:27:27,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:27:27,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:27:27,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 00:27:27,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:27:27,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:27:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:27:27,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:27:27,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-09 00:27:27,328 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:27:27,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:27,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2018-12-09 00:27:27,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:27,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:27,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:27,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:27:27,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:27:27,364 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-09 00:27:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:27,377 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-12-09 00:27:27,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:27:27,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2018-12-09 00:27:27,378 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:27:27,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2018-12-09 00:27:27,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-09 00:27:27,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 00:27:27,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2018-12-09 00:27:27,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:27:27,379 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-09 00:27:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2018-12-09 00:27:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-09 00:27:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-09 00:27:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-12-09 00:27:27,380 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-12-09 00:27:27,380 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-12-09 00:27:27,380 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 00:27:27,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-12-09 00:27:27,381 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:27:27,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:27,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:27,381 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-12-09 00:27:27,381 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:27,381 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 421#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 417#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 418#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 419#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 420#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 422#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 431#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 430#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 429#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 428#L23-3 assume !(main_~i~1 < 5); 416#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 409#L9-3 [2018-12-09 00:27:27,381 INFO L796 eck$LassoCheckResult]: Loop: 409#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 410#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 409#L9-3 [2018-12-09 00:27:27,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:27,382 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-12-09 00:27:27,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:27,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:27:27,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:27:27,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:27:27,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 00:27:27,420 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 00:27:27,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:27:27,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:27:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:27:27,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:27:27,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-09 00:27:27,446 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:27:27,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:27,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2018-12-09 00:27:27,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:27,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:27,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:27,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:27:27,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:27:27,472 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-12-09 00:27:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:27,487 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-12-09 00:27:27,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:27:27,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2018-12-09 00:27:27,488 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:27:27,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2018-12-09 00:27:27,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-09 00:27:27,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 00:27:27,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-12-09 00:27:27,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:27:27,489 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-09 00:27:27,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-12-09 00:27:27,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-09 00:27:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 00:27:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-12-09 00:27:27,490 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-09 00:27:27,490 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-09 00:27:27,490 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 00:27:27,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-12-09 00:27:27,491 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 00:27:27,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:27,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:27,491 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-12-09 00:27:27,491 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:27,491 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 517#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 513#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 514#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 515#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 516#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 518#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 529#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 528#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 527#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 526#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 525#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 524#L23-3 assume !(main_~i~1 < 5); 512#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 505#L9-3 [2018-12-09 00:27:27,491 INFO L796 eck$LassoCheckResult]: Loop: 505#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 506#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 505#L9-3 [2018-12-09 00:27:27,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:27,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-12-09 00:27:27,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:27,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:27,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2018-12-09 00:27:27,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:27,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:27,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:27,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:27,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2018-12-09 00:27:27,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:27,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:27,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:27,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:27,843 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2018-12-09 00:27:27,887 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:27:27,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:27:27,887 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:27:27,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:27:27,887 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:27:27,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:27:27,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:27:27,887 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:27:27,887 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum05_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-12-09 00:27:27,887 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:27:27,887 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:27:27,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:27,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:28,071 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:27:28,072 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:27:28,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:28,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:28,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:28,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:28,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:28,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:27:28,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:27:28,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:28,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:28,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:28,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:28,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:28,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:28,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:27:28,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:27:28,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:28,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:28,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:28,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:28,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:28,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:28,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:27:28,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:27:28,095 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:27:28,106 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:27:28,106 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:27:28,107 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:27:28,108 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:27:28,108 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:27:28,108 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0) = -2*ULTIMATE.start_sum_~i~0 + 9 Supporting invariants [] [2018-12-09 00:27:28,115 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 00:27:28,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:28,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:27:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:28,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:27:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:27:28,140 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 00:27:28,140 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-09 00:27:28,153 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 7 states. [2018-12-09 00:27:28,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 00:27:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:27:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-09 00:27:28,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-09 00:27:28,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:27:28,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-09 00:27:28,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:27:28,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-09 00:27:28,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:27:28,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-12-09 00:27:28,155 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 00:27:28,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2018-12-09 00:27:28,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-09 00:27:28,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-09 00:27:28,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2018-12-09 00:27:28,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:27:28,156 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-09 00:27:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2018-12-09 00:27:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-09 00:27:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 00:27:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-12-09 00:27:28,157 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-09 00:27:28,157 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-09 00:27:28,157 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 00:27:28,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-12-09 00:27:28,157 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 00:27:28,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:28,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:28,158 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:27:28,158 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:28,158 INFO L794 eck$LassoCheckResult]: Stem: 662#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 660#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 656#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 657#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 658#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 659#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 661#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 672#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 671#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 670#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 669#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 668#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 667#L23-3 assume !(main_~i~1 < 5); 655#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 647#L9-3 assume !(sum_~i~0 < 5); 645#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 646#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 665#L9-8 [2018-12-09 00:27:28,158 INFO L796 eck$LassoCheckResult]: Loop: 665#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 666#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 665#L9-8 [2018-12-09 00:27:28,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581027, now seen corresponding path program 1 times [2018-12-09 00:27:28,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:28,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:28,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:28,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 00:27:28,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:28,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:27:28,177 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:27:28,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:28,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2018-12-09 00:27:28,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:28,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:28,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:28,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:28,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:27:28,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:27:28,201 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-09 00:27:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:28,217 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-12-09 00:27:28,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:27:28,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2018-12-09 00:27:28,219 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 00:27:28,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2018-12-09 00:27:28,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-09 00:27:28,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 00:27:28,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2018-12-09 00:27:28,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:27:28,220 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-09 00:27:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2018-12-09 00:27:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-12-09 00:27:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 00:27:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-09 00:27:28,222 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-09 00:27:28,222 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-09 00:27:28,222 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 00:27:28,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2018-12-09 00:27:28,222 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 00:27:28,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:28,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:28,223 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:27:28,223 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:28,223 INFO L794 eck$LassoCheckResult]: Stem: 728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 727#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 723#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 724#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 725#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 726#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 740#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 739#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 738#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 737#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 736#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 735#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 734#L23-3 assume !(main_~i~1 < 5); 722#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 714#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 715#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 716#L9-3 assume !(sum_~i~0 < 5); 712#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 713#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 731#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 732#L9-7 [2018-12-09 00:27:28,224 INFO L796 eck$LassoCheckResult]: Loop: 732#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 733#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 732#L9-7 [2018-12-09 00:27:28,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:28,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1577614809, now seen corresponding path program 1 times [2018-12-09 00:27:28,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:28,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:28,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:28,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 00:27:28,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:27:28,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:27:28,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:28,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:27:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 00:27:28,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:27:28,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-09 00:27:28,293 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:27:28,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2018-12-09 00:27:28,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:28,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:28,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:27:28,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:27:28,313 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-09 00:27:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:28,346 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-12-09 00:27:28,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:27:28,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2018-12-09 00:27:28,347 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 00:27:28,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 43 transitions. [2018-12-09 00:27:28,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-09 00:27:28,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-09 00:27:28,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2018-12-09 00:27:28,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:27:28,348 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-09 00:27:28,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2018-12-09 00:27:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-12-09 00:27:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 00:27:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-09 00:27:28,349 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-09 00:27:28,349 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-09 00:27:28,349 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 00:27:28,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2018-12-09 00:27:28,350 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 00:27:28,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:28,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:28,350 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:27:28,350 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:28,350 INFO L794 eck$LassoCheckResult]: Stem: 866#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 862#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 858#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 859#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 860#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 861#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 863#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 876#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 875#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 874#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 873#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 872#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 871#L23-3 assume !(main_~i~1 < 5); 857#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 847#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 848#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 849#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 850#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 854#L9-3 assume !(sum_~i~0 < 5); 845#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 846#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 869#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 870#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 867#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 868#L9-7 [2018-12-09 00:27:28,350 INFO L796 eck$LassoCheckResult]: Loop: 868#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 877#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 868#L9-7 [2018-12-09 00:27:28,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:28,350 INFO L82 PathProgramCache]: Analyzing trace with hash -483964569, now seen corresponding path program 1 times [2018-12-09 00:27:28,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:28,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:28,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:28,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 00:27:28,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:27:28,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:27:28,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:28,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:27:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 00:27:28,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:27:28,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-09 00:27:28,430 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:27:28,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:28,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2018-12-09 00:27:28,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:28,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:28,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:28,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:28,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:27:28,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:27:28,453 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-12-09 00:27:28,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:28,486 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-12-09 00:27:28,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:27:28,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 49 transitions. [2018-12-09 00:27:28,487 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 00:27:28,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 49 transitions. [2018-12-09 00:27:28,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-09 00:27:28,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-09 00:27:28,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 49 transitions. [2018-12-09 00:27:28,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:27:28,488 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-09 00:27:28,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 49 transitions. [2018-12-09 00:27:28,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2018-12-09 00:27:28,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 00:27:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-12-09 00:27:28,490 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-09 00:27:28,490 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-09 00:27:28,490 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 00:27:28,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2018-12-09 00:27:28,490 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 00:27:28,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:28,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:28,491 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:27:28,491 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:28,491 INFO L794 eck$LassoCheckResult]: Stem: 1021#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1018#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1014#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1015#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1016#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1017#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1036#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1035#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1033#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1032#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1031#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1030#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1029#L23-3 assume !(main_~i~1 < 5); 1013#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1003#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1004#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1005#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1006#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1010#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1028#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1027#L9-3 assume !(sum_~i~0 < 5); 1001#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1002#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1024#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1025#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1026#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1037#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1022#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1023#L9-7 [2018-12-09 00:27:28,491 INFO L796 eck$LassoCheckResult]: Loop: 1023#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1034#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1023#L9-7 [2018-12-09 00:27:28,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:28,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1757450151, now seen corresponding path program 2 times [2018-12-09 00:27:28,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:28,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:28,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:28,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 00:27:28,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:27:28,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:27:28,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:27:28,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:27:28,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:27:28,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:27:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 00:27:28,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:27:28,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-09 00:27:28,580 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:27:28,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:28,580 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2018-12-09 00:27:28,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:28,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:28,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:28,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:28,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:27:28,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:27:28,603 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-09 00:27:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:28,643 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-12-09 00:27:28,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:27:28,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2018-12-09 00:27:28,643 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 00:27:28,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 55 transitions. [2018-12-09 00:27:28,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-12-09 00:27:28,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-12-09 00:27:28,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 55 transitions. [2018-12-09 00:27:28,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:27:28,644 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-12-09 00:27:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 55 transitions. [2018-12-09 00:27:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-12-09 00:27:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 00:27:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-12-09 00:27:28,646 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-09 00:27:28,646 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-09 00:27:28,646 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-09 00:27:28,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2018-12-09 00:27:28,647 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 00:27:28,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:28,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:28,647 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:27:28,647 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:28,647 INFO L794 eck$LassoCheckResult]: Stem: 1199#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1196#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1192#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1193#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1194#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1195#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1213#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1212#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1209#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1208#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1207#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1206#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1205#L23-3 assume !(main_~i~1 < 5); 1191#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1182#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1183#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1184#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1185#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1216#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1215#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1214#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1204#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1203#L9-3 assume !(sum_~i~0 < 5); 1180#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1181#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1200#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1201#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1202#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1220#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1219#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1218#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1217#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1211#L9-7 [2018-12-09 00:27:28,648 INFO L796 eck$LassoCheckResult]: Loop: 1211#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1210#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1211#L9-7 [2018-12-09 00:27:28,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:28,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1218450663, now seen corresponding path program 3 times [2018-12-09 00:27:28,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:28,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:28,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:28,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-09 00:27:28,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:27:28,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9680356a-3352-43e9-902a-5865ac9d94b1/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:27:28,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:27:28,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-09 00:27:28,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:27:28,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:27:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-09 00:27:28,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:27:28,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-09 00:27:28,748 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:27:28,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:28,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2018-12-09 00:27:28,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:28,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:28,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:28,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:28,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:27:28,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:27:28,770 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-12-09 00:27:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:28,819 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-12-09 00:27:28,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:27:28,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 58 transitions. [2018-12-09 00:27:28,820 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 00:27:28,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 58 transitions. [2018-12-09 00:27:28,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-12-09 00:27:28,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-12-09 00:27:28,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions. [2018-12-09 00:27:28,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:27:28,821 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-12-09 00:27:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions. [2018-12-09 00:27:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-09 00:27:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 00:27:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-12-09 00:27:28,823 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-09 00:27:28,823 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-09 00:27:28,823 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-09 00:27:28,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 49 transitions. [2018-12-09 00:27:28,823 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 00:27:28,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:28,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:28,824 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:27:28,824 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:28,824 INFO L794 eck$LassoCheckResult]: Stem: 1397#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1396#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1392#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1393#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1394#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1395#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1418#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1416#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1414#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1412#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1410#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1408#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1407#L23-3 assume !(main_~i~1 < 5); 1391#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1381#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1382#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1383#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1384#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1388#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1423#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1422#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1421#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1420#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1404#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1403#L9-3 assume !(sum_~i~0 < 5); 1379#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1380#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1400#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1401#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1402#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1419#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1417#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1415#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1413#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1411#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1409#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1406#L9-7 [2018-12-09 00:27:28,824 INFO L796 eck$LassoCheckResult]: Loop: 1406#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1405#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1406#L9-7 [2018-12-09 00:27:28,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:28,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2144167641, now seen corresponding path program 4 times [2018-12-09 00:27:28,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:28,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:28,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:28,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:28,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:28,900 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2018-12-09 00:27:28,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:28,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:28,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:28,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:28,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:28,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1039200421, now seen corresponding path program 5 times [2018-12-09 00:27:28,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:28,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:28,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:28,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-09 00:27:28,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:27:28,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:27:29,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:27:29,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:27:29,011 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-12-09 00:27:29,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:27:29,101 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-12-09 00:27:29,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:27:29,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2018-12-09 00:27:29,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:27:29,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 43 transitions. [2018-12-09 00:27:29,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-09 00:27:29,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-12-09 00:27:29,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 43 transitions. [2018-12-09 00:27:29,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:27:29,102 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-09 00:27:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 43 transitions. [2018-12-09 00:27:29,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 00:27:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 00:27:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-09 00:27:29,104 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-09 00:27:29,104 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-09 00:27:29,104 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-09 00:27:29,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 43 transitions. [2018-12-09 00:27:29,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:27:29,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:27:29,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:27:29,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:27:29,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:27:29,105 INFO L794 eck$LassoCheckResult]: Stem: 1520#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1517#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1513#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1514#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1515#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1516#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1538#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1537#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1535#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1533#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1531#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1528#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1527#L23-3 assume !(main_~i~1 < 5); 1512#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1507#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1508#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1509#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1536#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1534#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1532#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1530#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1529#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1526#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1525#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1524#L9-3 assume !(sum_~i~0 < 5); 1505#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1506#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1521#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1522#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1523#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1546#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1545#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1544#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1543#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1542#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1541#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1540#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1539#L9-8 assume !(sum_~i~0 < 5); 1518#L9-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1519#L12-1 main_#t~ret7 := sum_#res;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 1510#L32-3 [2018-12-09 00:27:29,105 INFO L796 eck$LassoCheckResult]: Loop: 1510#L32-3 assume !!(main_~i~2 < 4);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 1511#L32-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 1510#L32-3 [2018-12-09 00:27:29,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:29,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2055775835, now seen corresponding path program 1 times [2018-12-09 00:27:29,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:29,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:29,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:29,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:27:29,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:29,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:29,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2018-12-09 00:27:29,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:29,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:29,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:29,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:29,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:29,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:29,161 INFO L82 PathProgramCache]: Analyzing trace with hash 84380519, now seen corresponding path program 1 times [2018-12-09 00:27:29,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:27:29,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:27:29,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:29,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:27:29,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:27:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:27:31,103 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 319 DAG size of output: 243 [2018-12-09 00:27:44,572 WARN L180 SmtUtils]: Spent 13.45 s on a formula simplification. DAG size of input: 135 DAG size of output: 132 [2018-12-09 00:27:44,575 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:27:44,575 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:27:44,575 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:27:44,575 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:27:44,575 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:27:44,575 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:27:44,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:27:44,575 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:27:44,575 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum05_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-12-09 00:27:44,576 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:27:44,576 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:27:44,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:44,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:44,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:44,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:44,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:44,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:44,915 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 00:27:45,201 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2018-12-09 00:27:45,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:45,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:45,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:45,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:45,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:45,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:45,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:45,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:45,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:45,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:45,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:27:45,461 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2018-12-09 00:27:45,738 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-12-09 00:27:45,773 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:27:45,774 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:27:45,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:45,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:45,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:45,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:45,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:45,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:45,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:45,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:45,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:45,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:45,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:45,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:45,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:45,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:45,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:45,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:45,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:45,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:45,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:45,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:45,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:45,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:45,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:45,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:45,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:45,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:45,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:45,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:45,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:45,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:45,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:45,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:45,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:27:45,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:27:45,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:45,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:45,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:45,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:45,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:45,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:45,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:45,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:45,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:45,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:45,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:45,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:45,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:45,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:45,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:45,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:27:45,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:27:45,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:45,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:45,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:45,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:27:45,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:45,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:45,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:45,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:27:45,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:27:45,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:27:45,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:27:45,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:27:45,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:27:45,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:27:45,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:27:45,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:27:45,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:27:45,806 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:27:45,821 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-09 00:27:45,821 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-09 00:27:45,822 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:27:45,823 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:27:45,823 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:27:45,823 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3, ULTIMATE.start_main_~i~2) = 7*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 - 16*ULTIMATE.start_main_~i~2 Supporting invariants [] [2018-12-09 00:27:45,945 INFO L297 tatePredicateManager]: 39 out of 39 supporting invariants were superfluous and have been removed [2018-12-09 00:27:45,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 00:27:45,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:27:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:45,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:27:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:27:45,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:27:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:27:45,986 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 00:27:45,986 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-09 00:27:45,995 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 44 states and 46 transitions. Complement of second has 4 states. [2018-12-09 00:27:45,995 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 [2018-12-09 00:27:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 00:27:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-09 00:27:45,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 2 letters. [2018-12-09 00:27:45,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:27:45,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 42 letters. Loop has 2 letters. [2018-12-09 00:27:45,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:27:45,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 4 letters. [2018-12-09 00:27:45,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:27:45,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2018-12-09 00:27:45,997 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 00:27:45,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2018-12-09 00:27:45,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 00:27:45,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 00:27:45,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 00:27:45,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:27:45,997 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:27:45,998 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:27:45,998 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:27:45,998 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-09 00:27:45,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:27:45,998 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 00:27:45,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 00:27:46,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 12:27:46 BoogieIcfgContainer [2018-12-09 00:27:46,004 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 00:27:46,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:27:46,004 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:27:46,004 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:27:46,005 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:27:26" (3/4) ... [2018-12-09 00:27:46,007 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 00:27:46,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:27:46,008 INFO L168 Benchmark]: Toolchain (without parser) took 20078.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 954.4 MB in the beginning and 956.4 MB in the end (delta: -2.0 MB). Peak memory consumption was 176.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:27:46,009 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:27:46,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.73 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:27:46,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:27:46,010 INFO L168 Benchmark]: Boogie Preprocessor took 20.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:27:46,011 INFO L168 Benchmark]: RCFGBuilder took 163.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:27:46,011 INFO L168 Benchmark]: BuchiAutomizer took 19701.80 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 956.4 MB in the end (delta: 119.4 MB). Peak memory consumption was 200.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:27:46,012 INFO L168 Benchmark]: Witness Printer took 3.76 ms. Allocated memory is still 1.2 GB. Free memory is still 956.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:27:46,014 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.73 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 163.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19701.80 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 956.4 MB in the end (delta: 119.4 MB). Peak memory consumption was 200.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.76 ms. Allocated memory is still 1.2 GB. Free memory is still 956.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 9 and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function 7 * unknown-#length-unknown[x] + -16 * i and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.6s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 19.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 41 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 238 SDtfs, 190 SDslu, 454 SDs, 0 SdLazy, 300 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital552 mio100 ax100 hnf99 lsp125 ukn43 mio100 lsp61 div101 bol100 ite100 ukn100 eq166 hnf85 smp91 dnf154 smp83 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...