./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sep_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sep_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/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 e150e83dea41703782a488455769a24bf6c8f600 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:52:37,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:52:37,913 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:52:37,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:52:37,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:52:37,922 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:52:37,923 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:52:37,924 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:52:37,926 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:52:37,928 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:52:37,929 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:52:37,929 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:52:37,930 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:52:37,930 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:52:37,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:52:37,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:52:37,932 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:52:37,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:52:37,944 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:52:37,945 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:52:37,946 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:52:37,947 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:52:37,948 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:52:37,948 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:52:37,949 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:52:37,949 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:52:37,950 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:52:37,953 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:52:37,954 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:52:37,954 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:52:37,954 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:52:37,955 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:52:37,955 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:52:37,955 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:52:37,956 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:52:37,956 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:52:37,956 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 11:52:37,974 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:52:37,977 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:52:37,978 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:52:37,979 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:52:37,979 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:52:37,979 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 11:52:37,980 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 11:52:37,981 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 11:52:37,981 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 11:52:37,981 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 11:52:37,981 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 11:52:37,981 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:52:37,982 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:52:37,982 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 11:52:37,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:52:37,982 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:52:37,982 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:52:37,982 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 11:52:37,982 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 11:52:37,983 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 11:52:37,983 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:52:37,983 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:52:37,983 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 11:52:37,983 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:52:37,983 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 11:52:37,983 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:52:37,983 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:52:37,984 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 11:52:37,984 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:52:37,984 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:52:37,984 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 11:52:37,985 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 11:52:37,985 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_d0428b72-015a-4a64-a8ae-0107d4ce7743/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 -> e150e83dea41703782a488455769a24bf6c8f600 [2018-11-18 11:52:38,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:52:38,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:52:38,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:52:38,027 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:52:38,027 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:52:38,028 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/sep_true-unreach-call_true-termination.i [2018-11-18 11:52:38,082 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/bin-2019/uautomizer/data/bdbe553cc/c59a93fbd57d40c4b88004fdeea15ae6/FLAG6eb56df65 [2018-11-18 11:52:38,435 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:52:38,435 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/sv-benchmarks/c/reducercommutativity/sep_true-unreach-call_true-termination.i [2018-11-18 11:52:38,439 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/bin-2019/uautomizer/data/bdbe553cc/c59a93fbd57d40c4b88004fdeea15ae6/FLAG6eb56df65 [2018-11-18 11:52:38,450 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/bin-2019/uautomizer/data/bdbe553cc/c59a93fbd57d40c4b88004fdeea15ae6 [2018-11-18 11:52:38,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:52:38,454 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:52:38,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:52:38,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:52:38,460 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:52:38,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:52:38" (1/1) ... [2018-11-18 11:52:38,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2618fcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:38, skipping insertion in model container [2018-11-18 11:52:38,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:52:38" (1/1) ... [2018-11-18 11:52:38,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:52:38,483 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:52:38,612 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:52:38,618 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:52:38,635 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:52:38,646 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:52:38,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:38 WrapperNode [2018-11-18 11:52:38,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:52:38,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:52:38,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:52:38,647 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:52:38,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:38" (1/1) ... [2018-11-18 11:52:38,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:38" (1/1) ... [2018-11-18 11:52:38,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:52:38,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:52:38,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:52:38,682 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:52:38,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:38" (1/1) ... [2018-11-18 11:52:38,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:38" (1/1) ... [2018-11-18 11:52:38,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:38" (1/1) ... [2018-11-18 11:52:38,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:38" (1/1) ... [2018-11-18 11:52:38,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:38" (1/1) ... [2018-11-18 11:52:38,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:38" (1/1) ... [2018-11-18 11:52:38,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:38" (1/1) ... [2018-11-18 11:52:38,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:52:38,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:52:38,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:52:38,753 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:52:38,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/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-11-18 11:52:38,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 11:52:38,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 11:52:38,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:52:38,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:52:38,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 11:52:38,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 11:52:39,090 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:52:39,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:52:39 BoogieIcfgContainer [2018-11-18 11:52:39,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:52:39,091 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 11:52:39,091 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 11:52:39,095 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 11:52:39,096 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:52:39,096 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 11:52:38" (1/3) ... [2018-11-18 11:52:39,097 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a70725d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:52:39, skipping insertion in model container [2018-11-18 11:52:39,097 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:52:39,097 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:52:38" (2/3) ... [2018-11-18 11:52:39,098 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a70725d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:52:39, skipping insertion in model container [2018-11-18 11:52:39,098 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:52:39,098 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:52:39" (3/3) ... [2018-11-18 11:52:39,101 INFO L375 chiAutomizerObserver]: Analyzing ICFG sep_true-unreach-call_true-termination.i [2018-11-18 11:52:39,161 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:52:39,162 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 11:52:39,162 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 11:52:39,162 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 11:52:39,162 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:52:39,162 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:52:39,162 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 11:52:39,163 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:52:39,163 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 11:52:39,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-18 11:52:39,195 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2018-11-18 11:52:39,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:52:39,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:52:39,201 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 11:52:39,201 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:52:39,202 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 11:52:39,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-18 11:52:39,204 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2018-11-18 11:52:39,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:52:39,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:52:39,204 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 11:52:39,205 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:52:39,212 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 15#L23true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 4#L9-4true [2018-11-18 11:52:39,213 INFO L796 eck$LassoCheckResult]: Loop: 4#L9-4true assume true; 8#L9-1true assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 30#L11true assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 6#L9-3true sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 4#L9-4true [2018-11-18 11:52:39,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:39,218 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-18 11:52:39,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:39,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:39,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:39,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:39,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:39,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:39,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1205642, now seen corresponding path program 1 times [2018-11-18 11:52:39,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:39,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:39,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:39,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:39,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:39,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:39,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1804968363, now seen corresponding path program 1 times [2018-11-18 11:52:39,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:39,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:39,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:39,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:39,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:39,629 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-11-18 11:52:39,761 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:52:39,762 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:52:39,762 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:52:39,762 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:52:39,762 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:52:39,762 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:52:39,762 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:52:39,762 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:52:39,763 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-18 11:52:39,763 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:52:39,763 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:52:39,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:39,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:39,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:39,944 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-11-18 11:52:39,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:39,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:39,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:39,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:39,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:39,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:40,521 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:52:40,525 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:52:40,527 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-11-18 11:52:40,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:40,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:40,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:40,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:40,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:40,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:40,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:40,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:40,533 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-11-18 11:52:40,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:40,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:40,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:40,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:40,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:40,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:40,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:40,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:40,536 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-11-18 11:52:40,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:40,537 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:52:40,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:40,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:40,540 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:52:40,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:40,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:40,558 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-11-18 11:52:40,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:40,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:40,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:40,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:40,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:40,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:40,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:40,564 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-11-18 11:52:40,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:40,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:40,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:40,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:40,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:40,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:40,629 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:52:40,708 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 11:52:40,709 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 11:52:40,713 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:52:40,715 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:52:40,716 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:52:40,716 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~x.offset, v_rep(select #length ULTIMATE.start_sep_~x.base)_1, ULTIMATE.start_sep_~i~0) = -1*ULTIMATE.start_sep_~x.offset + 1*v_rep(select #length ULTIMATE.start_sep_~x.base)_1 - 4*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2018-11-18 11:52:40,734 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 11:52:40,742 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:52:40,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:40,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:52:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:40,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:52:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:52:40,872 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-11-18 11:52:40,874 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 4 states. [2018-11-18 11:52:40,926 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 4 states. Result 65 states and 87 transitions. Complement of second has 8 states. [2018-11-18 11:52:40,928 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-11-18 11:52:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 11:52:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2018-11-18 11:52:40,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-18 11:52:40,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:52:40,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 11:52:40,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:52:40,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-18 11:52:40,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:52:40,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 87 transitions. [2018-11-18 11:52:40,936 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-18 11:52:40,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 25 states and 34 transitions. [2018-11-18 11:52:40,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 11:52:40,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-18 11:52:40,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-18 11:52:40,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:52:40,940 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-18 11:52:40,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-18 11:52:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-18 11:52:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 11:52:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-11-18 11:52:40,959 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-18 11:52:40,959 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-18 11:52:40,959 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 11:52:40,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2018-11-18 11:52:40,960 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-18 11:52:40,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:52:40,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:52:40,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:52:40,961 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:52:40,961 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 176#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 177#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 161#L9-4 assume true; 163#L9-1 assume !(sep_~i~0 < ~N~0); 170#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 165#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 166#L9-10 [2018-11-18 11:52:40,962 INFO L796 eck$LassoCheckResult]: Loop: 166#L9-10 assume true; 178#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 174#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 175#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 166#L9-10 [2018-11-18 11:52:40,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:40,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966695, now seen corresponding path program 1 times [2018-11-18 11:52:40,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:40,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:40,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:40,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:40,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:52:41,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:52:41,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:52:41,022 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:52:41,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:41,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1882890, now seen corresponding path program 1 times [2018-11-18 11:52:41,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:41,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:41,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:41,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:41,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:41,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:52:41,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:52:41,148 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-18 11:52:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:52:41,169 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-11-18 11:52:41,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:52:41,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2018-11-18 11:52:41,170 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-18 11:52:41,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 35 transitions. [2018-11-18 11:52:41,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 11:52:41,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-18 11:52:41,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-11-18 11:52:41,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:52:41,172 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-18 11:52:41,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-11-18 11:52:41,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-18 11:52:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 11:52:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-11-18 11:52:41,174 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-18 11:52:41,174 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-18 11:52:41,174 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 11:52:41,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2018-11-18 11:52:41,175 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-18 11:52:41,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:52:41,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:52:41,176 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:52:41,176 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:52:41,176 INFO L794 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 238#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 239#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 221#L9-4 assume true; 222#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 231#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 227#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 223#L9-4 assume true; 224#L9-1 assume !(sep_~i~0 < ~N~0); 230#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 225#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 226#L9-10 [2018-11-18 11:52:41,176 INFO L796 eck$LassoCheckResult]: Loop: 226#L9-10 assume true; 236#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 234#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 235#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 226#L9-10 [2018-11-18 11:52:41,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:41,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2102080274, now seen corresponding path program 1 times [2018-11-18 11:52:41,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:41,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:41,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:41,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:52:41,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:52:41,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/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-11-18 11:52:41,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:41,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:52:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:52:41,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:52:41,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 11:52:41,328 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:52:41,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:41,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1882890, now seen corresponding path program 2 times [2018-11-18 11:52:41,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:41,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:41,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:41,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:41,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:41,466 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 11:52:41,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:52:41,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:52:41,545 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-18 11:52:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:52:41,575 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2018-11-18 11:52:41,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:52:41,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 41 transitions. [2018-11-18 11:52:41,576 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-18 11:52:41,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 40 transitions. [2018-11-18 11:52:41,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 11:52:41,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-18 11:52:41,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2018-11-18 11:52:41,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:52:41,577 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-18 11:52:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2018-11-18 11:52:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-11-18 11:52:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 11:52:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-11-18 11:52:41,579 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-18 11:52:41,579 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-18 11:52:41,579 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 11:52:41,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2018-11-18 11:52:41,579 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-18 11:52:41,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:52:41,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:52:41,580 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 11:52:41,580 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:52:41,580 INFO L794 eck$LassoCheckResult]: Stem: 339#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 335#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 336#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 318#L9-4 assume true; 319#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 342#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 341#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 320#L9-4 assume true; 321#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 330#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 324#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 325#L9-4 assume true; 328#L9-1 assume !(sep_~i~0 < ~N~0); 329#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 322#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 323#L9-10 [2018-11-18 11:52:41,580 INFO L796 eck$LassoCheckResult]: Loop: 323#L9-10 assume true; 337#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 333#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 334#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 323#L9-10 [2018-11-18 11:52:41,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1345862859, now seen corresponding path program 2 times [2018-11-18 11:52:41,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:41,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:41,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:52:41,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:41,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:41,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1882890, now seen corresponding path program 3 times [2018-11-18 11:52:41,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:41,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:41,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:41,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:52:41,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:41,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:41,634 INFO L82 PathProgramCache]: Analyzing trace with hash 858244158, now seen corresponding path program 1 times [2018-11-18 11:52:41,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:41,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:41,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:41,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:52:41,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:52:42,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:52:42,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/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-11-18 11:52:42,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:42,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:52:42,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-18 11:52:42,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-11-18 11:52:42,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-18 11:52:42,360 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:52:42,371 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:42,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:42,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:42,396 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2018-11-18 11:52:42,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-18 11:52:42,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-11-18 11:52:42,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:52:42,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:42,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:42,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2018-11-18 11:52:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:52:42,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:52:42,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-11-18 11:52:42,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:52:42,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:52:42,548 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 11 Second operand 14 states. [2018-11-18 11:52:43,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:52:43,347 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2018-11-18 11:52:43,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:52:43,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 124 transitions. [2018-11-18 11:52:43,348 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 25 [2018-11-18 11:52:43,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 124 transitions. [2018-11-18 11:52:43,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2018-11-18 11:52:43,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2018-11-18 11:52:43,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 124 transitions. [2018-11-18 11:52:43,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:52:43,349 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 124 transitions. [2018-11-18 11:52:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 124 transitions. [2018-11-18 11:52:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 41. [2018-11-18 11:52:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 11:52:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2018-11-18 11:52:43,351 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2018-11-18 11:52:43,352 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2018-11-18 11:52:43,352 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 11:52:43,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 52 transitions. [2018-11-18 11:52:43,352 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-18 11:52:43,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:52:43,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:52:43,352 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:52:43,352 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:52:43,352 INFO L794 eck$LassoCheckResult]: Stem: 558#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 555#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 556#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 537#L9-4 assume true; 538#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 569#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 568#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 539#L9-4 assume true; 540#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 549#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 543#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 544#L9-4 assume true; 547#L9-1 assume !(sep_~i~0 < ~N~0); 548#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 541#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 542#L9-10 [2018-11-18 11:52:43,353 INFO L796 eck$LassoCheckResult]: Loop: 542#L9-10 assume true; 557#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 562#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 553#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 542#L9-10 [2018-11-18 11:52:43,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1403121161, now seen corresponding path program 1 times [2018-11-18 11:52:43,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:43,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:43,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:43,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:43,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:43,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:43,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1882890, now seen corresponding path program 4 times [2018-11-18 11:52:43,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:43,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:43,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:43,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:43,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:43,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:43,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1251271168, now seen corresponding path program 1 times [2018-11-18 11:52:43,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:43,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:43,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:43,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:52:43,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:43,782 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 123 [2018-11-18 11:52:44,009 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-11-18 11:52:44,010 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:52:44,010 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:52:44,010 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:52:44,010 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:52:44,010 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:52:44,010 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:52:44,011 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:52:44,011 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:52:44,011 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration5_Lasso [2018-11-18 11:52:44,011 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:52:44,011 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:52:44,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:44,405 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:52:44,405 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:52:44,406 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-11-18 11:52:44,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:44,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:44,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:44,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:44,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:44,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:44,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:44,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:44,409 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-11-18 11:52:44,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:44,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:44,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:44,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:44,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:44,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:44,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:44,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:44,411 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-11-18 11:52:44,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:44,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:44,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:44,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:44,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:44,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:44,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:44,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:44,412 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-11-18 11:52:44,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:44,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:44,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:44,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:44,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:44,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:44,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:44,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:44,418 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-11-18 11:52:44,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:44,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:44,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:44,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:44,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:44,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:44,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:44,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:44,419 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-11-18 11:52:44,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:44,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:44,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:44,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:44,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:44,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:44,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:44,422 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-11-18 11:52:44,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:44,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:44,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:44,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:44,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:44,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:44,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:44,425 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-11-18 11:52:44,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:44,425 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:52:44,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:44,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:44,427 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:52:44,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:44,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:44,431 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-11-18 11:52:44,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:44,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:44,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:44,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:44,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:44,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:44,441 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:52:44,449 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 11:52:44,449 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 11:52:44,450 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:52:44,450 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:52:44,450 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:52:44,451 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2018-11-18 11:52:44,524 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 11:52:44,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:44,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:52:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:44,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:52:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:52:44,567 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-11-18 11:52:44,568 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 52 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-18 11:52:44,585 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 52 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 53 states and 69 transitions. Complement of second has 7 states. [2018-11-18 11:52:44,585 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-11-18 11:52:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 11:52:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-18 11:52:44,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-18 11:52:44,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:52:44,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 11:52:44,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:52:44,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-18 11:52:44,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:52:44,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 69 transitions. [2018-11-18 11:52:44,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 11:52:44,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 44 states and 56 transitions. [2018-11-18 11:52:44,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-18 11:52:44,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-18 11:52:44,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 56 transitions. [2018-11-18 11:52:44,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:52:44,588 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-11-18 11:52:44,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 56 transitions. [2018-11-18 11:52:44,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-18 11:52:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 11:52:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-11-18 11:52:44,591 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 55 transitions. [2018-11-18 11:52:44,591 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 55 transitions. [2018-11-18 11:52:44,591 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 11:52:44,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 55 transitions. [2018-11-18 11:52:44,592 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 11:52:44,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:52:44,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:52:44,593 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:52:44,593 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 11:52:44,593 INFO L794 eck$LassoCheckResult]: Stem: 754#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 751#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 752#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 728#L9-4 assume true; 729#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 766#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 765#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 730#L9-4 assume true; 731#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 763#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 762#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 760#L9-4 assume true; 759#L9-1 assume !(sep_~i~0 < ~N~0); 755#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 756#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 758#L9-10 assume true; 747#L9-7 assume !(sep_~i~0 < ~N~0); 743#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 724#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 725#L35-4 [2018-11-18 11:52:44,593 INFO L796 eck$LassoCheckResult]: Loop: 725#L35-4 assume true; 750#L35-1 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 753#L35-3 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 725#L35-4 [2018-11-18 11:52:44,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:44,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1251269500, now seen corresponding path program 1 times [2018-11-18 11:52:44,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:44,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:44,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:44,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:44,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 11:52:44,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:52:44,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:52:44,656 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:52:44,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:44,656 INFO L82 PathProgramCache]: Analyzing trace with hash 82582, now seen corresponding path program 1 times [2018-11-18 11:52:44,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:44,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:44,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:44,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:44,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:44,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:52:44,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:52:44,688 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-18 11:52:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:52:44,711 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-18 11:52:44,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:52:44,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. [2018-11-18 11:52:44,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 11:52:44,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 50 states and 62 transitions. [2018-11-18 11:52:44,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-18 11:52:44,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-18 11:52:44,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 62 transitions. [2018-11-18 11:52:44,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:52:44,713 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2018-11-18 11:52:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 62 transitions. [2018-11-18 11:52:44,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-11-18 11:52:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 11:52:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-11-18 11:52:44,716 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-18 11:52:44,716 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-18 11:52:44,716 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 11:52:44,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 53 transitions. [2018-11-18 11:52:44,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 11:52:44,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:52:44,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:52:44,717 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:52:44,717 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 11:52:44,717 INFO L794 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 846#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 847#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 829#L9-4 assume true; 830#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 860#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 835#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 831#L9-4 assume true; 832#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 867#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 857#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 858#L9-4 assume true; 838#L9-1 assume !(sep_~i~0 < ~N~0); 839#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 833#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 834#L9-10 assume true; 852#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 861#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 845#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 850#L9-10 assume true; 851#L9-7 assume !(sep_~i~0 < ~N~0); 842#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 825#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 826#L35-4 [2018-11-18 11:52:44,717 INFO L796 eck$LassoCheckResult]: Loop: 826#L35-4 assume true; 853#L35-1 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 855#L35-3 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 826#L35-4 [2018-11-18 11:52:44,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:44,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1422667843, now seen corresponding path program 1 times [2018-11-18 11:52:44,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:44,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:44,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:44,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:44,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 11:52:44,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:52:44,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/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-11-18 11:52:44,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:44,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:52:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 11:52:44,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:52:44,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-18 11:52:44,861 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:52:44,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:44,861 INFO L82 PathProgramCache]: Analyzing trace with hash 82582, now seen corresponding path program 2 times [2018-11-18 11:52:44,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:44,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:44,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:44,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:44,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:44,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:52:44,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:52:44,908 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. cyclomatic complexity: 15 Second operand 7 states. [2018-11-18 11:52:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:52:44,984 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2018-11-18 11:52:44,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:52:44,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 75 transitions. [2018-11-18 11:52:44,986 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 11:52:44,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 60 states and 74 transitions. [2018-11-18 11:52:44,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-18 11:52:44,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-18 11:52:44,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 74 transitions. [2018-11-18 11:52:44,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:52:44,987 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 74 transitions. [2018-11-18 11:52:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 74 transitions. [2018-11-18 11:52:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2018-11-18 11:52:44,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 11:52:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2018-11-18 11:52:44,989 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-18 11:52:44,989 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-18 11:52:44,989 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 11:52:44,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 58 transitions. [2018-11-18 11:52:44,989 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 11:52:44,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:52:44,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:52:44,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:52:44,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 11:52:44,990 INFO L794 eck$LassoCheckResult]: Stem: 1035#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1029#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1030#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1011#L9-4 assume true; 1012#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1051#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1050#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1013#L9-4 assume true; 1014#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1053#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1017#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1018#L9-4 assume true; 1046#L9-1 assume !(sep_~i~0 < ~N~0); 1045#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1044#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1043#L9-10 assume true; 1042#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1040#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1036#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1032#L9-10 assume true; 1033#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1027#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1028#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1039#L9-10 assume true; 1038#L9-7 assume !(sep_~i~0 < ~N~0); 1025#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1007#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1008#L35-4 [2018-11-18 11:52:44,990 INFO L796 eck$LassoCheckResult]: Loop: 1008#L35-4 assume true; 1034#L35-1 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1037#L35-3 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1008#L35-4 [2018-11-18 11:52:44,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:44,991 INFO L82 PathProgramCache]: Analyzing trace with hash 372099466, now seen corresponding path program 2 times [2018-11-18 11:52:44,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:44,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:44,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:44,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:52:44,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:45,330 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2018-11-18 11:52:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 11:52:45,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:52:45,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/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-11-18 11:52:45,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 11:52:45,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 11:52:45,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:52:45,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:52:45,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-18 11:52:45,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-18 11:52:45,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-18 11:52:45,552 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:52:45,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:45,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:45,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:45,568 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:22 [2018-11-18 11:52:45,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-18 11:52:45,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-11-18 11:52:45,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:52:45,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:45,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:45,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2018-11-18 11:52:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 11:52:45,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:52:45,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-11-18 11:52:45,607 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:52:45,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:45,607 INFO L82 PathProgramCache]: Analyzing trace with hash 82582, now seen corresponding path program 3 times [2018-11-18 11:52:45,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:45,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:45,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:45,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:52:45,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:45,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:52:45,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:52:45,644 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. cyclomatic complexity: 16 Second operand 14 states. [2018-11-18 11:52:46,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:52:46,106 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-11-18 11:52:46,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 11:52:46,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 95 transitions. [2018-11-18 11:52:46,108 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-18 11:52:46,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 95 transitions. [2018-11-18 11:52:46,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-18 11:52:46,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-18 11:52:46,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 95 transitions. [2018-11-18 11:52:46,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:52:46,109 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 95 transitions. [2018-11-18 11:52:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 95 transitions. [2018-11-18 11:52:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 47. [2018-11-18 11:52:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 11:52:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-11-18 11:52:46,110 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-18 11:52:46,110 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-18 11:52:46,110 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 11:52:46,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 57 transitions. [2018-11-18 11:52:46,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 11:52:46,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:52:46,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:52:46,111 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:52:46,111 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 11:52:46,111 INFO L794 eck$LassoCheckResult]: Stem: 1271#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1267#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1268#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1245#L9-4 assume true; 1246#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1280#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1251#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1247#L9-4 assume true; 1248#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1287#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1272#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1279#L9-4 assume true; 1254#L9-1 assume !(sep_~i~0 < ~N~0); 1255#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1249#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1250#L9-10 assume true; 1284#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1282#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1269#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1264#L9-10 assume true; 1265#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1260#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1261#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1281#L9-10 assume true; 1273#L9-7 assume !(sep_~i~0 < ~N~0); 1258#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1241#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1242#L35-4 [2018-11-18 11:52:46,111 INFO L796 eck$LassoCheckResult]: Loop: 1242#L35-4 assume true; 1266#L35-1 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1270#L35-3 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1242#L35-4 [2018-11-18 11:52:46,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:46,111 INFO L82 PathProgramCache]: Analyzing trace with hash 765126476, now seen corresponding path program 1 times [2018-11-18 11:52:46,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:46,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:46,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:46,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:52:46,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:46,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:46,144 INFO L82 PathProgramCache]: Analyzing trace with hash 82582, now seen corresponding path program 4 times [2018-11-18 11:52:46,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:46,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:46,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:46,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:46,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:46,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash 491459435, now seen corresponding path program 1 times [2018-11-18 11:52:46,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:46,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:46,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:46,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:52:46,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:46,635 WARN L180 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 163 [2018-11-18 11:52:46,896 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2018-11-18 11:52:46,897 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:52:46,897 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:52:46,897 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:52:46,897 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:52:46,898 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:52:46,898 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:52:46,898 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:52:46,898 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:52:46,898 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-18 11:52:46,898 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:52:46,898 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:52:46,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:46,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:47,339 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:52:47,339 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:52:47,340 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-11-18 11:52:47,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,342 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-11-18 11:52:47,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,343 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-11-18 11:52:47,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,345 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-11-18 11:52:47,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,346 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-11-18 11:52:47,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:47,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:47,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,349 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-11-18 11:52:47,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,352 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-11-18 11:52:47,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,354 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-11-18 11:52:47,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,356 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-11-18 11:52:47,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:47,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:47,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,368 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-11-18 11:52:47,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,370 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-11-18 11:52:47,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,379 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-11-18 11:52:47,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:47,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:47,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,382 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-11-18 11:52:47,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:47,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:47,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,392 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-11-18 11:52:47,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,394 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-11-18 11:52:47,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:47,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:47,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,396 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-11-18 11:52:47,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,398 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-11-18 11:52:47,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,401 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-11-18 11:52:47,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,403 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-11-18 11:52:47,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,404 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-11-18 11:52:47,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:47,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:47,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:47,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,406 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-11-18 11:52:47,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:47,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:47,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,409 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-11-18 11:52:47,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:47,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:47,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,413 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-11-18 11:52:47,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,414 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:52:47,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,427 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:52:47,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:47,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:47,430 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-11-18 11:52:47,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:47,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:47,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:47,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:47,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:47,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:47,448 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:52:47,457 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 11:52:47,457 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 11:52:47,457 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:52:47,458 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:52:47,458 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:52:47,459 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#x~0.offset, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3, ULTIMATE.start_main_~i~1) = -1*ULTIMATE.start_main_~#x~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 - 4*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-18 11:52:47,506 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 11:52:47,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:52:47,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:47,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:52:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:47,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:52:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:52:47,558 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-11-18 11:52:47,559 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 57 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-18 11:52:47,578 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 57 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 55 states and 68 transitions. Complement of second has 6 states. [2018-11-18 11:52:47,582 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-11-18 11:52:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 11:52:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-18 11:52:47,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 27 letters. Loop has 3 letters. [2018-11-18 11:52:47,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:52:47,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 30 letters. Loop has 3 letters. [2018-11-18 11:52:47,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:52:47,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 27 letters. Loop has 6 letters. [2018-11-18 11:52:47,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:52:47,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 68 transitions. [2018-11-18 11:52:47,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:52:47,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 49 states and 60 transitions. [2018-11-18 11:52:47,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 11:52:47,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 11:52:47,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 60 transitions. [2018-11-18 11:52:47,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:52:47,585 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-11-18 11:52:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 60 transitions. [2018-11-18 11:52:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-18 11:52:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 11:52:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2018-11-18 11:52:47,588 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-11-18 11:52:47,588 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-11-18 11:52:47,588 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 11:52:47,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 60 transitions. [2018-11-18 11:52:47,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:52:47,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:52:47,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:52:47,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:52:47,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:52:47,589 INFO L794 eck$LassoCheckResult]: Stem: 1522#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1513#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1514#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1496#L9-4 assume true; 1497#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1540#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1502#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1498#L9-4 assume true; 1499#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1539#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1525#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1536#L9-4 assume true; 1505#L9-1 assume !(sep_~i~0 < ~N~0); 1506#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1528#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1515#L9-10 assume true; 1516#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1527#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1529#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1517#L9-10 assume true; 1518#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1511#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1512#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1523#L9-10 assume true; 1526#L9-7 assume !(sep_~i~0 < ~N~0); 1509#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1492#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1493#L35-4 assume true; 1520#L35-1 assume !(main_~i~1 < ~N~0 - 1); 1510#L35-5 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1495#L9-16 [2018-11-18 11:52:47,589 INFO L796 eck$LassoCheckResult]: Loop: 1495#L9-16 assume true; 1503#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1504#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1494#L9-15 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1495#L9-16 [2018-11-18 11:52:47,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:47,590 INFO L82 PathProgramCache]: Analyzing trace with hash 491459377, now seen corresponding path program 1 times [2018-11-18 11:52:47,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:47,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:47,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:47,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:47,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 11:52:47,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:52:47,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:52:47,729 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:52:47,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:47,729 INFO L82 PathProgramCache]: Analyzing trace with hash 3021898, now seen corresponding path program 1 times [2018-11-18 11:52:47,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:47,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:47,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:47,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:47,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:47,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:52:47,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:52:47,849 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-18 11:52:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:52:47,869 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-18 11:52:47,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:52:47,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 62 transitions. [2018-11-18 11:52:47,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:52:47,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 51 states and 61 transitions. [2018-11-18 11:52:47,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-18 11:52:47,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 11:52:47,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 61 transitions. [2018-11-18 11:52:47,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:52:47,872 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 61 transitions. [2018-11-18 11:52:47,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 61 transitions. [2018-11-18 11:52:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-18 11:52:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 11:52:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2018-11-18 11:52:47,874 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 59 transitions. [2018-11-18 11:52:47,874 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 59 transitions. [2018-11-18 11:52:47,874 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 11:52:47,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 59 transitions. [2018-11-18 11:52:47,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:52:47,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:52:47,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:52:47,875 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:52:47,875 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:52:47,876 INFO L794 eck$LassoCheckResult]: Stem: 1631#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1622#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1623#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1604#L9-4 assume true; 1605#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1648#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1645#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1606#L9-4 assume true; 1607#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1647#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1610#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1611#L9-4 assume true; 1641#L9-1 assume !(sep_~i~0 < ~N~0); 1636#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1608#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1609#L9-10 assume true; 1639#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1638#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1637#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1626#L9-10 assume true; 1627#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1620#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1621#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1632#L9-10 assume true; 1634#L9-7 assume !(sep_~i~0 < ~N~0); 1618#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1600#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1601#L35-4 assume true; 1628#L35-1 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1633#L35-3 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1629#L35-4 assume true; 1630#L35-1 assume !(main_~i~1 < ~N~0 - 1); 1619#L35-5 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1603#L9-16 [2018-11-18 11:52:47,876 INFO L796 eck$LassoCheckResult]: Loop: 1603#L9-16 assume true; 1612#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1613#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1602#L9-15 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1603#L9-16 [2018-11-18 11:52:47,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:47,876 INFO L82 PathProgramCache]: Analyzing trace with hash -475431246, now seen corresponding path program 1 times [2018-11-18 11:52:47,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:47,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:47,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:47,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:47,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:47,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:47,926 INFO L82 PathProgramCache]: Analyzing trace with hash 3021898, now seen corresponding path program 2 times [2018-11-18 11:52:47,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:47,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:47,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:47,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:47,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:47,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:47,935 INFO L82 PathProgramCache]: Analyzing trace with hash -525936005, now seen corresponding path program 1 times [2018-11-18 11:52:47,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:47,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:47,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:47,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:52:47,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:48,267 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 20 [2018-11-18 11:52:48,413 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 27 [2018-11-18 11:52:48,927 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2018-11-18 11:52:49,110 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2018-11-18 11:52:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 11:52:49,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:52:49,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/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-11-18 11:52:49,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:49,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:52:49,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-11-18 11:52:49,341 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:52:49,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2018-11-18 11:52:49,350 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:52:49,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-18 11:52:49,353 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:52:49,357 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:49,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:49,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:49,363 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:43, output treesize:19 [2018-11-18 11:52:49,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-18 11:52:49,414 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:52:49,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-11-18 11:52:49,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:52:49,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:49,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:49,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-11-18 11:52:49,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-11-18 11:52:49,453 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:52:49,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 48 [2018-11-18 11:52:49,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 11:52:49,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 11:52:49,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 11:52:49,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:46 [2018-11-18 11:52:49,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-18 11:52:49,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-11-18 11:52:49,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:52:49,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:49,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:49,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2018-11-18 11:52:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 11:52:49,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:52:49,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 23 [2018-11-18 11:52:49,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 11:52:49,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2018-11-18 11:52:49,618 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. cyclomatic complexity: 15 Second operand 23 states. [2018-11-18 11:52:51,187 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2018-11-18 11:52:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:52:51,583 INFO L93 Difference]: Finished difference Result 149 states and 176 transitions. [2018-11-18 11:52:51,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-18 11:52:51,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 176 transitions. [2018-11-18 11:52:51,585 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-18 11:52:51,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 176 transitions. [2018-11-18 11:52:51,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2018-11-18 11:52:51,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-11-18 11:52:51,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 176 transitions. [2018-11-18 11:52:51,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:52:51,587 INFO L705 BuchiCegarLoop]: Abstraction has 149 states and 176 transitions. [2018-11-18 11:52:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 176 transitions. [2018-11-18 11:52:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 96. [2018-11-18 11:52:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-18 11:52:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2018-11-18 11:52:51,594 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 115 transitions. [2018-11-18 11:52:51,594 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 115 transitions. [2018-11-18 11:52:51,594 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 11:52:51,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 115 transitions. [2018-11-18 11:52:51,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:52:51,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:52:51,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:52:51,595 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:52:51,595 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:52:51,595 INFO L794 eck$LassoCheckResult]: Stem: 2023#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 2018#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2019#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1992#L9-4 assume true; 1993#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2054#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1998#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1994#L9-4 assume true; 1995#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2053#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2038#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2039#L9-4 assume true; 2002#L9-1 assume !(sep_~i~0 < ~N~0); 2003#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2031#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2046#L9-10 assume true; 2042#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2043#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2068#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2067#L9-10 assume true; 2064#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2066#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 2065#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2063#L9-10 assume true; 2062#L9-7 assume !(sep_~i~0 < ~N~0); 2061#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2060#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 2014#L35-4 assume true; 2015#L35-1 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 2058#L35-3 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2057#L35-4 assume true; 2056#L35-1 assume !(main_~i~1 < ~N~0 - 1); 2007#L35-5 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1991#L9-16 [2018-11-18 11:52:51,596 INFO L796 eck$LassoCheckResult]: Loop: 1991#L9-16 assume true; 1999#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2000#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1990#L9-15 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1991#L9-16 [2018-11-18 11:52:51,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:51,596 INFO L82 PathProgramCache]: Analyzing trace with hash 34041844, now seen corresponding path program 1 times [2018-11-18 11:52:51,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:51,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:51,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:51,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:51,793 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2018-11-18 11:52:52,007 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2018-11-18 11:52:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 11:52:52,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:52:52,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d0428b72-015a-4a64-a8ae-0107d4ce7743/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-11-18 11:52:52,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:52,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:52:52,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-11-18 11:52:52,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-18 11:52:52,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-18 11:52:52,240 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:52:52,244 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:52,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:52,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:52,250 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:16 [2018-11-18 11:52:52,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-18 11:52:52,295 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 11:52:52,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 11:52:52,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:52:52,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:52,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:52:52,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:5 [2018-11-18 11:52:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 11:52:52,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:52:52,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2018-11-18 11:52:52,344 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:52:52,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:52,344 INFO L82 PathProgramCache]: Analyzing trace with hash 3021898, now seen corresponding path program 3 times [2018-11-18 11:52:52,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:52,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:52,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:52,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:52:52,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:52,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 11:52:52,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-11-18 11:52:52,387 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. cyclomatic complexity: 27 Second operand 21 states. [2018-11-18 11:52:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:52:53,928 INFO L93 Difference]: Finished difference Result 200 states and 233 transitions. [2018-11-18 11:52:53,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-18 11:52:53,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 233 transitions. [2018-11-18 11:52:53,930 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-18 11:52:53,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 199 states and 232 transitions. [2018-11-18 11:52:53,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2018-11-18 11:52:53,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-18 11:52:53,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 232 transitions. [2018-11-18 11:52:53,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:52:53,932 INFO L705 BuchiCegarLoop]: Abstraction has 199 states and 232 transitions. [2018-11-18 11:52:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 232 transitions. [2018-11-18 11:52:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 142. [2018-11-18 11:52:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-18 11:52:53,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 167 transitions. [2018-11-18 11:52:53,936 INFO L728 BuchiCegarLoop]: Abstraction has 142 states and 167 transitions. [2018-11-18 11:52:53,936 INFO L608 BuchiCegarLoop]: Abstraction has 142 states and 167 transitions. [2018-11-18 11:52:53,936 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 11:52:53,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 167 transitions. [2018-11-18 11:52:53,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 11:52:53,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:52:53,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:52:53,938 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:52:53,938 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 11:52:53,938 INFO L794 eck$LassoCheckResult]: Stem: 2496#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 2487#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2488#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2468#L9-4 assume true; 2469#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2501#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2474#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2475#L9-4 assume true; 2542#L9-1 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2543#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 2562#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2561#L9-4 assume true; 2560#L9-1 assume !(sep_~i~0 < ~N~0); 2559#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2558#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2557#L9-10 assume true; 2556#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2555#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 2554#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2553#L9-10 assume true; 2552#L9-7 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2551#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2549#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2547#L9-10 assume true; 2503#L9-7 assume !(sep_~i~0 < ~N~0); 2483#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2464#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 2465#L35-4 assume true; 2493#L35-1 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 2506#L35-3 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2494#L35-4 assume true; 2495#L35-1 assume !(main_~i~1 < ~N~0 - 1); 2484#L35-5 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2467#L9-16 [2018-11-18 11:52:53,938 INFO L796 eck$LassoCheckResult]: Loop: 2467#L9-16 assume true; 2476#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2477#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2466#L9-15 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2467#L9-16 [2018-11-18 11:52:53,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:53,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1379205454, now seen corresponding path program 2 times [2018-11-18 11:52:53,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:53,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:53,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:53,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:52:53,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:53,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:53,979 INFO L82 PathProgramCache]: Analyzing trace with hash 3021898, now seen corresponding path program 4 times [2018-11-18 11:52:53,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:53,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:53,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:53,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:52:53,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:53,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:53,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1106748805, now seen corresponding path program 2 times [2018-11-18 11:52:53,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:52:53,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:52:53,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:53,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:52:53,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:52:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:52:54,282 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 11:52:55,102 WARN L180 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 196 [2018-11-18 11:52:55,500 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-18 11:52:55,501 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:52:55,501 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:52:55,501 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:52:55,501 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:52:55,501 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:52:55,501 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:52:55,501 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:52:55,501 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:52:55,502 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration13_Lasso [2018-11-18 11:52:55,502 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:52:55,502 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:52:55,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:52:55,853 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:52:55,853 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:52:55,853 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-11-18 11:52:55,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:55,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:55,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:55,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,856 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-11-18 11:52:55,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:55,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:55,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:55,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,857 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-11-18 11:52:55,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:55,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:55,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:55,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,859 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-11-18 11:52:55,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:55,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:55,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,871 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-11-18 11:52:55,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:55,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:55,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:55,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,872 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-11-18 11:52:55,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:55,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:55,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,878 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-11-18 11:52:55,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:55,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:55,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:55,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,880 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-11-18 11:52:55,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:55,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:55,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,882 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-11-18 11:52:55,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:55,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:55,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:55,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,891 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-11-18 11:52:55,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:55,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:55,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,893 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-11-18 11:52:55,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:55,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:55,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:55,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,895 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-11-18 11:52:55,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:55,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:55,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,897 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-11-18 11:52:55,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:55,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:55,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:55,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,910 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-11-18 11:52:55,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:55,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:55,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:55,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,912 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-11-18 11:52:55,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:55,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:55,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:55,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,914 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-11-18 11:52:55,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:52:55,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:52:55,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:52:55,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,915 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-11-18 11:52:55,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:55,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:55,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,918 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-11-18 11:52:55,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,918 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:52:55,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,919 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:52:55,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:55,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,922 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-11-18 11:52:55,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:55,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:55,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,931 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-11-18 11:52:55,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:55,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:55,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:52:55,933 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-11-18 11:52:55,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:52:55,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:52:55,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:52:55,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:52:55,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:52:55,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:52:55,962 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:52:55,978 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 11:52:55,978 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 11:52:55,979 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:52:55,979 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:52:55,979 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:52:55,980 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sep_~x.base)_4, ULTIMATE.start_sep_~x.offset, ULTIMATE.start_sep_~i~0) = 1*v_rep(select #length ULTIMATE.start_sep_~x.base)_4 - 1*ULTIMATE.start_sep_~x.offset - 4*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2018-11-18 11:52:56,102 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 11:52:56,127 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:52:56,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:52:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:56,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:52:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:52:56,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:52:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:52:56,188 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-11-18 11:52:56,188 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 167 transitions. cyclomatic complexity: 36 Second operand 4 states. [2018-11-18 11:52:56,197 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 167 transitions. cyclomatic complexity: 36. Second operand 4 states. Result 150 states and 179 transitions. Complement of second has 6 states. [2018-11-18 11:52:56,198 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-11-18 11:52:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 11:52:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-18 11:52:56,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 33 letters. Loop has 4 letters. [2018-11-18 11:52:56,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:52:56,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 37 letters. Loop has 4 letters. [2018-11-18 11:52:56,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:52:56,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 33 letters. Loop has 8 letters. [2018-11-18 11:52:56,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:52:56,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 179 transitions. [2018-11-18 11:52:56,202 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:52:56,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 0 states and 0 transitions. [2018-11-18 11:52:56,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 11:52:56,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 11:52:56,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 11:52:56,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:52:56,203 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:52:56,203 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:52:56,203 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:52:56,203 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 11:52:56,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:52:56,203 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:52:56,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 11:52:56,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:52:56 BoogieIcfgContainer [2018-11-18 11:52:56,208 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:52:56,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:52:56,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:52:56,209 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:52:56,209 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:52:39" (3/4) ... [2018-11-18 11:52:56,212 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 11:52:56,212 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:52:56,213 INFO L168 Benchmark]: Toolchain (without parser) took 17759.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 962.3 MB in the beginning and 1.2 GB in the end (delta: -271.3 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:52:56,213 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:52:56,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.88 ms. Allocated memory is still 1.0 GB. Free memory was 962.3 MB in the beginning and 951.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:52:56,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.31 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:52:56,214 INFO L168 Benchmark]: Boogie Preprocessor took 71.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 946.2 MB in the beginning and 1.2 GB in the end (delta: -212.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:52:56,215 INFO L168 Benchmark]: RCFGBuilder took 337.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:52:56,215 INFO L168 Benchmark]: BuchiAutomizer took 17117.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.5 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:52:56,215 INFO L168 Benchmark]: Witness Printer took 3.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:52:56,218 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.88 ms. Allocated memory is still 1.0 GB. Free memory was 962.3 MB in the beginning and 951.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 34.31 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 946.2 MB in the beginning and 1.2 GB in the end (delta: -212.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 337.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17117.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.5 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 13 terminating modules (9 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 5 locations. One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -1 * x + -4 * i and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.0s and 14 iterations. TraceHistogramMax:3. Analysis of lassos took 11.5s. Construction of modules took 1.6s. Büchi inclusion checks took 3.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 228 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 142 states and ocurred in iteration 12. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 333 SDtfs, 777 SDslu, 1113 SDs, 0 SdLazy, 1847 SolverSat, 384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU7 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital184 mio100 ax100 hnf99 lsp89 ukn71 mio100 lsp60 div100 bol100 ite100 ukn100 eq167 hnf89 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 3 VariablesLoop: 2 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...