./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sum.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/sum.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 e17f830a1ee9b998b40fe12c0d4d25b23cde3738 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:52:27,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:52:27,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:52:27,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:52:27,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:52:27,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:52:27,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:52:27,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:52:27,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:52:27,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:52:27,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:52:27,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:52:27,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:52:27,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:52:27,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:52:27,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:52:27,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:52:27,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:52:27,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:52:27,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:52:27,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:52:27,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:52:27,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:52:27,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:52:27,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:52:27,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:52:27,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:52:27,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:52:27,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:52:27,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:52:27,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:52:27,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:52:27,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:52:27,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:52:27,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:52:28,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:52:28,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:52:28,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:52:28,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:52:28,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:52:28,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:52:28,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:52:28,020 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:52:28,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:52:28,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:52:28,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:52:28,023 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:52:28,023 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:52:28,023 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:52:28,024 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:52:28,024 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:52:28,024 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:52:28,024 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:52:28,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:52:28,025 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:52:28,025 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:52:28,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:52:28,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:52:28,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:52:28,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:52:28,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:52:28,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:52:28,027 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:52:28,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:52:28,028 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:52:28,028 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:52:28,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:52:28,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:52:28,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:52:28,029 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:52:28,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:52:28,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:52:28,030 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:52:28,031 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:52:28,031 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> e17f830a1ee9b998b40fe12c0d4d25b23cde3738 [2019-11-28 03:52:28,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:52:28,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:52:28,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:52:28,350 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:52:28,350 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:52:28,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum.i [2019-11-28 03:52:28,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb2d7a6c2/5e8c119390cc49e0bd5c1ebcbe0538ea/FLAG29be900d0 [2019-11-28 03:52:28,827 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:52:28,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum.i [2019-11-28 03:52:28,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb2d7a6c2/5e8c119390cc49e0bd5c1ebcbe0538ea/FLAG29be900d0 [2019-11-28 03:52:29,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb2d7a6c2/5e8c119390cc49e0bd5c1ebcbe0538ea [2019-11-28 03:52:29,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:52:29,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:52:29,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:52:29,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:52:29,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:52:29,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:29" (1/1) ... [2019-11-28 03:52:29,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155b5aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:29, skipping insertion in model container [2019-11-28 03:52:29,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:29" (1/1) ... [2019-11-28 03:52:29,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:52:29,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:52:29,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:52:29,477 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:52:29,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:52:29,510 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:52:29,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:29 WrapperNode [2019-11-28 03:52:29,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:52:29,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:52:29,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:52:29,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:52:29,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:29" (1/1) ... [2019-11-28 03:52:29,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:29" (1/1) ... [2019-11-28 03:52:29,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:52:29,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:52:29,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:52:29,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:52:29,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:29" (1/1) ... [2019-11-28 03:52:29,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:29" (1/1) ... [2019-11-28 03:52:29,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:29" (1/1) ... [2019-11-28 03:52:29,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:29" (1/1) ... [2019-11-28 03:52:29,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:29" (1/1) ... [2019-11-28 03:52:29,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:29" (1/1) ... [2019-11-28 03:52:29,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:29" (1/1) ... [2019-11-28 03:52:29,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:52:29,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:52:29,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:52:29,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:52:29,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 03:52:29,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:52:29,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:52:29,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:52:29,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:52:29,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:52:29,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:52:30,032 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:52:30,033 INFO L297 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-28 03:52:30,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:30 BoogieIcfgContainer [2019-11-28 03:52:30,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:52:30,034 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:52:30,035 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:52:30,038 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:52:30,039 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:30,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:52:29" (1/3) ... [2019-11-28 03:52:30,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59617cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:30, skipping insertion in model container [2019-11-28 03:52:30,041 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:30,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:29" (2/3) ... [2019-11-28 03:52:30,041 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59617cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:30, skipping insertion in model container [2019-11-28 03:52:30,044 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:30,044 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:30" (3/3) ... [2019-11-28 03:52:30,046 INFO L371 chiAutomizerObserver]: Analyzing ICFG sum.i [2019-11-28 03:52:30,097 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:52:30,097 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:52:30,097 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:52:30,097 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:52:30,098 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:52:30,098 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:52:30,098 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:52:30,098 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:52:30,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-28 03:52:30,129 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:30,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:30,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:30,135 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:52:30,135 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:30,136 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:52:30,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-28 03:52:30,138 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:52:30,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:30,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:30,139 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:52:30,139 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:30,147 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 14#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 13#L20true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 9#L11-3true [2019-11-28 03:52:30,147 INFO L796 eck$LassoCheckResult]: Loop: 9#L11-3true assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 12#L11-2true sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 9#L11-3true [2019-11-28 03:52:30,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:30,154 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-28 03:52:30,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:30,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88897807] [2019-11-28 03:52:30,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:30,290 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:30,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2019-11-28 03:52:30,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:30,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369912216] [2019-11-28 03:52:30,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:30,328 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:30,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:30,331 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2019-11-28 03:52:30,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:30,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779395675] [2019-11-28 03:52:30,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:30,396 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:30,618 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-28 03:52:30,681 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:30,682 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:30,682 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:30,682 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:30,683 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:30,683 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:30,683 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:30,683 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:30,683 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum.i_Iteration1_Lasso [2019-11-28 03:52:30,683 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:30,684 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:30,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:30,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:31,226 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:31,232 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,240 INFO L120 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 [2019-11-28 03:52:31,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:31,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:31,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:31,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:31,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:31,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:31,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:31,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:31,281 INFO L120 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 [2019-11-28 03:52:31,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:31,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:31,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:31,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:31,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:31,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:31,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:31,308 INFO L120 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 [2019-11-28 03:52:31,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:31,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:31,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:31,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:31,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:31,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:31,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:31,334 INFO L120 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 [2019-11-28 03:52:31,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:31,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:31,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:31,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:31,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:31,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:31,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:31,360 INFO L120 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 [2019-11-28 03:52:31,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:31,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:31,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:31,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:31,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:31,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:31,389 INFO L120 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 [2019-11-28 03:52:31,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:31,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:31,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:31,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:31,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:31,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:31,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,413 INFO L120 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 [2019-11-28 03:52:31,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:31,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:31,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:31,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:31,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:31,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:31,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:31,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:31,432 INFO L120 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 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:31,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:31,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:31,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:31,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:31,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:31,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:31,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,450 INFO L120 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 [2019-11-28 03:52:31,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:31,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:31,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:31,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:31,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:31,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:31,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:31,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:31,482 INFO L120 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 [2019-11-28 03:52:31,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:31,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:31,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:31,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:31,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:31,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:31,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,505 INFO L120 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 [2019-11-28 03:52:31,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:31,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:31,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:31,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:31,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:31,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:31,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:31,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:31,528 INFO L120 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 [2019-11-28 03:52:31,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:31,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:31,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:31,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:31,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:31,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:31,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,550 INFO L120 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 [2019-11-28 03:52:31,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:31,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:31,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:31,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:31,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:31,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:31,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,578 INFO L120 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 [2019-11-28 03:52:31,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:31,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:31,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:31,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:31,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:31,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:31,606 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:31,669 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-28 03:52:31,669 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:31,731 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:31,753 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:31,753 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:31,754 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sum_~x.base)_1, ULTIMATE.start_sum_~i~0, ULTIMATE.start_sum_~x.offset) = 1*v_rep(select #length ULTIMATE.start_sum_~x.base)_1 - 4*ULTIMATE.start_sum_~i~0 - 1*ULTIMATE.start_sum_~x.offset Supporting invariants [] [2019-11-28 03:52:31,770 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 03:52:31,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:52:31,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:31,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:31,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:31,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:31,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:31,876 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 [2019-11-28 03:52:31,878 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-11-28 03:52:31,951 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 51 states and 69 transitions. Complement of second has 8 states. [2019-11-28 03:52:31,952 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 [2019-11-28 03:52:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:52:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-11-28 03:52:31,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 03:52:31,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:31,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 03:52:31,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:31,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-28 03:52:31,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:31,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2019-11-28 03:52:31,974 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:31,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 23 transitions. [2019-11-28 03:52:31,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:52:31,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:52:31,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-11-28 03:52:31,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:31,993 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 03:52:32,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-11-28 03:52:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 03:52:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:52:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-28 03:52:32,032 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 03:52:32,032 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 03:52:32,032 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:52:32,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-28 03:52:32,033 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:32,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:32,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:32,034 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:52:32,035 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:32,035 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 141#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 140#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 136#L11-3 assume !(sum_~i~0 < ~N~0); 132#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 133#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 145#L11-8 [2019-11-28 03:52:32,035 INFO L796 eck$LassoCheckResult]: Loop: 145#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 146#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 145#L11-8 [2019-11-28 03:52:32,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:32,036 INFO L82 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2019-11-28 03:52:32,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:32,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105093781] [2019-11-28 03:52:32,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:32,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105093781] [2019-11-28 03:52:32,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:52:32,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:52:32,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198235148] [2019-11-28 03:52:32,137 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:32,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:32,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2019-11-28 03:52:32,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:32,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64428610] [2019-11-28 03:52:32,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:32,148 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:32,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:32,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:52:32,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:52:32,205 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 03:52:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:32,239 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-11-28 03:52:32,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:52:32,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-11-28 03:52:32,242 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:32,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2019-11-28 03:52:32,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:52:32,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:52:32,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-28 03:52:32,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:32,243 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-28 03:52:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-28 03:52:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 03:52:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:52:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-28 03:52:32,246 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 03:52:32,246 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 03:52:32,246 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:52:32,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-28 03:52:32,247 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:32,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:32,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:32,248 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:32,248 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:32,248 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 182#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 181#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 177#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 178#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 179#L11-3 assume !(sum_~i~0 < ~N~0); 173#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 174#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 186#L11-8 [2019-11-28 03:52:32,248 INFO L796 eck$LassoCheckResult]: Loop: 186#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 187#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 186#L11-8 [2019-11-28 03:52:32,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:32,249 INFO L82 PathProgramCache]: Analyzing trace with hash 123162473, now seen corresponding path program 1 times [2019-11-28 03:52:32,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:32,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873162043] [2019-11-28 03:52:32,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:32,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873162043] [2019-11-28 03:52:32,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893094504] [2019-11-28 03:52:32,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:32,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:32,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:32,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:32,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-28 03:52:32,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722344432] [2019-11-28 03:52:32,441 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:32,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:32,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 2 times [2019-11-28 03:52:32,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:32,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734683959] [2019-11-28 03:52:32,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:32,461 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:32,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:52:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:52:32,500 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-11-28 03:52:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:32,552 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-11-28 03:52:32,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:52:32,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-11-28 03:52:32,554 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:32,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2019-11-28 03:52:32,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-28 03:52:32,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 03:52:32,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-11-28 03:52:32,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:32,557 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-28 03:52:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-11-28 03:52:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-28 03:52:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 03:52:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-28 03:52:32,561 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-28 03:52:32,562 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-28 03:52:32,562 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:52:32,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2019-11-28 03:52:32,563 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:52:32,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:32,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:32,564 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:32,564 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:32,565 INFO L794 eck$LassoCheckResult]: Stem: 251#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 250#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 249#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 244#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 245#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 246#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 247#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 256#L11-3 assume !(sum_~i~0 < ~N~0); 240#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 241#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 254#L11-8 [2019-11-28 03:52:32,565 INFO L796 eck$LassoCheckResult]: Loop: 254#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 255#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 254#L11-8 [2019-11-28 03:52:32,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:32,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228857, now seen corresponding path program 2 times [2019-11-28 03:52:32,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:32,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56001350] [2019-11-28 03:52:32,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:32,626 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:32,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:32,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 3 times [2019-11-28 03:52:32,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:32,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994506361] [2019-11-28 03:52:32,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:32,635 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:32,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:32,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1163170153, now seen corresponding path program 1 times [2019-11-28 03:52:32,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:32,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487631781] [2019-11-28 03:52:32,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:32,746 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:33,232 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 107 [2019-11-28 03:52:33,523 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-28 03:52:33,526 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:33,526 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:33,526 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:33,526 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:33,526 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:33,526 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:33,526 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:33,527 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:33,527 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum.i_Iteration4_Lasso [2019-11-28 03:52:33,527 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:33,527 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:33,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:33,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:33,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:33,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:33,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:33,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:33,968 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-11-28 03:52:34,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:34,492 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:34,493 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:34,514 INFO L120 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 [2019-11-28 03:52:34,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:34,539 INFO L120 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 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:34,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,555 INFO L120 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 [2019-11-28 03:52:34,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:34,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,583 INFO L120 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 [2019-11-28 03:52:34,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:34,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,618 INFO L120 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 [2019-11-28 03:52:34,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:34,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:34,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:34,639 INFO L120 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 [2019-11-28 03:52:34,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:34,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:34,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:34,653 INFO L120 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 [2019-11-28 03:52:34,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:34,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:34,676 INFO L120 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 [2019-11-28 03:52:34,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:34,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:34,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:34,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:34,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:34,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,701 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:34,726 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 03:52:34,726 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:34,731 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:52:34,734 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:34,734 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:34,734 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, ULTIMATE.start_sum_~x.offset, v_rep(select #length ULTIMATE.start_sum_~x.base)_2) = -4*ULTIMATE.start_sum_~i~0 - 1*ULTIMATE.start_sum_~x.offset + 1*v_rep(select #length ULTIMATE.start_sum_~x.base)_2 Supporting invariants [] [2019-11-28 03:52:34,752 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:52:34,753 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:52:34,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:34,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:34,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:34,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:34,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:34,809 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 [2019-11-28 03:52:34,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 03:52:34,841 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 26 states and 33 transitions. Complement of second has 7 states. [2019-11-28 03:52:34,842 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 [2019-11-28 03:52:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:52:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-28 03:52:34,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-28 03:52:34,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:34,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-28 03:52:34,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:34,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 03:52:34,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:34,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-11-28 03:52:34,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:34,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 24 transitions. [2019-11-28 03:52:34,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 03:52:34,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 03:52:34,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2019-11-28 03:52:34,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:34,847 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-28 03:52:34,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2019-11-28 03:52:34,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 03:52:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 03:52:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-11-28 03:52:34,850 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-28 03:52:34,851 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-28 03:52:34,851 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:52:34,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2019-11-28 03:52:34,852 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:34,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:34,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:34,853 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:34,853 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:34,853 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 371#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 370#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 365#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 366#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 367#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 368#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 378#L11-3 assume !(sum_~i~0 < ~N~0); 361#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 362#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 375#L11-8 assume !(sum_~i~0 < ~N~0); 373#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 374#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 363#L32-3 [2019-11-28 03:52:34,854 INFO L796 eck$LassoCheckResult]: Loop: 363#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 364#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 363#L32-3 [2019-11-28 03:52:34,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:34,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1698534614, now seen corresponding path program 1 times [2019-11-28 03:52:34,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:34,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567638759] [2019-11-28 03:52:34,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:52:34,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567638759] [2019-11-28 03:52:34,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:52:34,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:52:34,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324255257] [2019-11-28 03:52:34,892 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:34,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:34,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 1 times [2019-11-28 03:52:34,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:34,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291341728] [2019-11-28 03:52:34,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:34,901 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:34,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:34,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:52:34,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:52:34,947 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-28 03:52:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:34,984 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-11-28 03:52:34,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:52:34,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2019-11-28 03:52:34,986 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:34,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2019-11-28 03:52:34,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 03:52:34,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 03:52:34,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2019-11-28 03:52:34,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:34,988 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-28 03:52:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2019-11-28 03:52:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-11-28 03:52:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 03:52:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-28 03:52:34,990 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-28 03:52:34,990 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-28 03:52:34,991 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:52:34,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-11-28 03:52:34,991 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:34,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:34,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:34,992 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:34,992 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:34,993 INFO L794 eck$LassoCheckResult]: Stem: 422#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 421#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 420#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 415#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 416#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 417#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 418#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 428#L11-3 assume !(sum_~i~0 < ~N~0); 411#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 412#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 425#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 426#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 427#L11-8 assume !(sum_~i~0 < ~N~0); 423#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 424#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 413#L32-3 [2019-11-28 03:52:34,993 INFO L796 eck$LassoCheckResult]: Loop: 413#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 414#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 413#L32-3 [2019-11-28 03:52:34,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:34,993 INFO L82 PathProgramCache]: Analyzing trace with hash 205910964, now seen corresponding path program 1 times [2019-11-28 03:52:34,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:34,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49470254] [2019-11-28 03:52:34,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:52:35,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49470254] [2019-11-28 03:52:35,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731379064] [2019-11-28 03:52:35,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:35,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:35,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:52:35,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:35,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-28 03:52:35,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718506070] [2019-11-28 03:52:35,140 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:35,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:35,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 2 times [2019-11-28 03:52:35,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:35,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709964261] [2019-11-28 03:52:35,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,164 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:35,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:35,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:52:35,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:52:35,241 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-11-28 03:52:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:35,328 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-11-28 03:52:35,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:52:35,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2019-11-28 03:52:35,330 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:35,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 31 transitions. [2019-11-28 03:52:35,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-28 03:52:35,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 03:52:35,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2019-11-28 03:52:35,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:35,333 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-28 03:52:35,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2019-11-28 03:52:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-11-28 03:52:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 03:52:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-28 03:52:35,336 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-28 03:52:35,339 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-28 03:52:35,339 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:52:35,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2019-11-28 03:52:35,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:35,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:35,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:35,342 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:35,342 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:35,342 INFO L794 eck$LassoCheckResult]: Stem: 524#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 523#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 522#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 517#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 518#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 519#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 520#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 531#L11-3 assume !(sum_~i~0 < ~N~0); 513#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 514#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 527#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 528#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 529#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 530#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 532#L11-8 assume !(sum_~i~0 < ~N~0); 525#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 526#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 515#L32-3 [2019-11-28 03:52:35,343 INFO L796 eck$LassoCheckResult]: Loop: 515#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 516#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 515#L32-3 [2019-11-28 03:52:35,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:35,344 INFO L82 PathProgramCache]: Analyzing trace with hash 313660178, now seen corresponding path program 2 times [2019-11-28 03:52:35,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:35,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784560932] [2019-11-28 03:52:35,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,441 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:35,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:35,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 3 times [2019-11-28 03:52:35,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:35,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409983202] [2019-11-28 03:52:35,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,449 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash 779721780, now seen corresponding path program 1 times [2019-11-28 03:52:35,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:35,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478137287] [2019-11-28 03:52:35,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:35,519 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:36,245 WARN L192 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 140 [2019-11-28 03:52:37,238 WARN L192 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2019-11-28 03:52:37,241 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:37,241 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:37,241 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:37,242 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:37,242 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:37,242 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:37,242 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:37,242 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:37,242 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum.i_Iteration7_Lasso [2019-11-28 03:52:37,243 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:37,243 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:37,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:37,399 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-28 03:52:37,903 WARN L192 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-11-28 03:52:38,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:38,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:38,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:38,317 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-28 03:52:39,019 WARN L192 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-11-28 03:52:39,128 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:39,128 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,136 INFO L120 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 [2019-11-28 03:52:39,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:39,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,145 INFO L120 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 [2019-11-28 03:52:39,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:39,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,154 INFO L120 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 [2019-11-28 03:52:39,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:39,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:39,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,167 INFO L120 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 [2019-11-28 03:52:39,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:39,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,176 INFO L120 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 [2019-11-28 03:52:39,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:39,181 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,186 INFO L120 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 [2019-11-28 03:52:39,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:39,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,199 INFO L120 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 [2019-11-28 03:52:39,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:39,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:39,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,233 INFO L120 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 [2019-11-28 03:52:39,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,244 INFO L120 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 [2019-11-28 03:52:39,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,255 INFO L120 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 [2019-11-28 03:52:39,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,267 INFO L120 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 [2019-11-28 03:52:39,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,280 INFO L120 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 [2019-11-28 03:52:39,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:39,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:39,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,292 INFO L120 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 [2019-11-28 03:52:39,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:39,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,309 INFO L120 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 [2019-11-28 03:52:39,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,312 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:52:39,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,344 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 03:52:39,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:39,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:39,383 INFO L120 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 [2019-11-28 03:52:39,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:39,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:39,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:39,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:39,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:39,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,409 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:39,480 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2019-11-28 03:52:39,480 INFO L444 ModelExtractionUtils]: 3 out of 28 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:39,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:52:39,487 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:52:39,488 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:39,488 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, ULTIMATE.start_sum_~x.offset, ULTIMATE.start_main_~i~1) = 2*ULTIMATE.start_sum_~i~0 - 1*ULTIMATE.start_sum_~x.offset - 4*ULTIMATE.start_main_~i~1 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 + 8 >= 0] [2019-11-28 03:52:39,530 INFO L297 tatePredicateManager]: 7 out of 10 supporting invariants were superfluous and have been removed [2019-11-28 03:52:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:39,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 03:52:39,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:39,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2019-11-28 03:52:39,614 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:52:39,626 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:52:39,627 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:52:39,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-28 03:52:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:39,839 WARN L253 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:52:39,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:39,867 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2019-11-28 03:52:39,867 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 11 states. [2019-11-28 03:52:40,293 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 7. Second operand 11 states. Result 52 states and 64 transitions. Complement of second has 16 states. [2019-11-28 03:52:40,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-28 03:52:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 03:52:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2019-11-28 03:52:40,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 44 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-28 03:52:40,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:40,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 44 transitions. Stem has 19 letters. Loop has 2 letters. [2019-11-28 03:52:40,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:40,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 44 transitions. Stem has 17 letters. Loop has 4 letters. [2019-11-28 03:52:40,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:40,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 64 transitions. [2019-11-28 03:52:40,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:40,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 41 states and 48 transitions. [2019-11-28 03:52:40,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-28 03:52:40,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-28 03:52:40,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 48 transitions. [2019-11-28 03:52:40,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:40,303 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-28 03:52:40,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 48 transitions. [2019-11-28 03:52:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2019-11-28 03:52:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 03:52:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-11-28 03:52:40,307 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-28 03:52:40,307 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-28 03:52:40,307 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:52:40,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2019-11-28 03:52:40,308 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:40,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:40,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:40,309 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:40,309 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:40,310 INFO L794 eck$LassoCheckResult]: Stem: 758#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 757#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 756#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 751#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 752#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 753#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 754#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 778#L11-3 assume !(sum_~i~0 < ~N~0); 745#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 746#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 761#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 762#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 765#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 774#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 772#L11-8 assume !(sum_~i~0 < ~N~0); 769#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 768#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 767#L32-3 assume !(main_~i~1 < ~N~0 - 1); 743#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 744#L11-13 [2019-11-28 03:52:40,310 INFO L796 eck$LassoCheckResult]: Loop: 744#L11-13 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 755#L11-12 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 744#L11-13 [2019-11-28 03:52:40,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:40,310 INFO L82 PathProgramCache]: Analyzing trace with hash 779721722, now seen corresponding path program 1 times [2019-11-28 03:52:40,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:40,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042375773] [2019-11-28 03:52:40,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 03:52:40,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042375773] [2019-11-28 03:52:40,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:52:40,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:52:40,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038464255] [2019-11-28 03:52:40,352 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:40,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:40,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2019-11-28 03:52:40,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:40,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009491974] [2019-11-28 03:52:40,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:40,358 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:40,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:40,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:52:40,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:52:40,382 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 03:52:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:40,425 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-11-28 03:52:40,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:52:40,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 44 transitions. [2019-11-28 03:52:40,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:40,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 44 transitions. [2019-11-28 03:52:40,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-28 03:52:40,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-28 03:52:40,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 44 transitions. [2019-11-28 03:52:40,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:40,431 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-11-28 03:52:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 44 transitions. [2019-11-28 03:52:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-11-28 03:52:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 03:52:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-11-28 03:52:40,434 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-11-28 03:52:40,435 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-11-28 03:52:40,435 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:52:40,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 42 transitions. [2019-11-28 03:52:40,435 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:40,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:40,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:40,436 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:40,436 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:40,436 INFO L794 eck$LassoCheckResult]: Stem: 841#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 840#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 839#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 832#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 833#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 834#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 835#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 857#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 856#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 855#L11-3 assume !(sum_~i~0 < ~N~0); 827#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 828#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 852#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 853#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 847#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 848#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 851#L11-8 assume !(sum_~i~0 < ~N~0); 842#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 843#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 844#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 836#L32-2 [2019-11-28 03:52:40,437 INFO L796 eck$LassoCheckResult]: Loop: 836#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 837#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 836#L32-2 [2019-11-28 03:52:40,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1001145849, now seen corresponding path program 1 times [2019-11-28 03:52:40,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:40,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203446035] [2019-11-28 03:52:40,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:40,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203446035] [2019-11-28 03:52:40,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020187339] [2019-11-28 03:52:40,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:40,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:52:40,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:40,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:40,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-28 03:52:40,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161629248] [2019-11-28 03:52:40,625 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:40,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:40,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2463, now seen corresponding path program 4 times [2019-11-28 03:52:40,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:40,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377679823] [2019-11-28 03:52:40,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:40,633 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:40,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:40,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 03:52:40,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-11-28 03:52:40,694 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. cyclomatic complexity: 10 Second operand 16 states. [2019-11-28 03:52:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:41,035 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-11-28 03:52:41,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 03:52:41,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 57 transitions. [2019-11-28 03:52:41,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:41,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 57 transitions. [2019-11-28 03:52:41,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-28 03:52:41,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-11-28 03:52:41,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 57 transitions. [2019-11-28 03:52:41,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:41,040 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-11-28 03:52:41,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 57 transitions. [2019-11-28 03:52:41,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2019-11-28 03:52:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 03:52:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-11-28 03:52:41,043 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-11-28 03:52:41,043 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-11-28 03:52:41,043 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:52:41,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2019-11-28 03:52:41,044 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:52:41,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:41,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:41,045 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:41,045 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:41,045 INFO L794 eck$LassoCheckResult]: Stem: 1026#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1025#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 1024#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1018#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1019#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1020#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1021#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1046#L11-3 assume !(sum_~i~0 < ~N~0); 1045#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1044#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1043#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1033#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1034#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1042#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1039#L11-8 assume !(sum_~i~0 < ~N~0); 1038#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1037#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 1036#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 1017#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 1016#L32-3 assume !(main_~i~1 < ~N~0 - 1); 1010#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1011#L11-13 [2019-11-28 03:52:41,045 INFO L796 eck$LassoCheckResult]: Loop: 1011#L11-13 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1023#L11-12 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1011#L11-13 [2019-11-28 03:52:41,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1988322460, now seen corresponding path program 1 times [2019-11-28 03:52:41,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:41,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024695104] [2019-11-28 03:52:41,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:41,084 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:41,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:41,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2019-11-28 03:52:41,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:41,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404304949] [2019-11-28 03:52:41,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:41,089 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:41,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:41,090 INFO L82 PathProgramCache]: Analyzing trace with hash -482560770, now seen corresponding path program 1 times [2019-11-28 03:52:41,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:41,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010806473] [2019-11-28 03:52:41,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:41,134 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:42,191 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 224 DAG size of output: 177 [2019-11-28 03:52:43,803 WARN L192 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2019-11-28 03:52:43,806 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:43,806 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:43,806 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:43,806 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:43,806 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:43,806 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:43,806 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:43,806 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:43,806 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum.i_Iteration10_Lasso [2019-11-28 03:52:43,807 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:43,807 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:43,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:43,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:43,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:43,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:43,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:43,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:43,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:43,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:43,908 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-28 03:52:44,403 WARN L192 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-11-28 03:52:44,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:44,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:44,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:44,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:44,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:44,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:44,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:44,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:44,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:44,739 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-11-28 03:52:45,032 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-11-28 03:52:45,057 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:45,057 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:45,073 INFO L120 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 [2019-11-28 03:52:45,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:45,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:45,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:45,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:45,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:45,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:45,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:45,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:45,086 INFO L120 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 [2019-11-28 03:52:45,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:45,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:45,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:45,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:45,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:45,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:45,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:45,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:45,099 INFO L120 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 [2019-11-28 03:52:45,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:45,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:45,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:45,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:45,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:45,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:45,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:45,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:45,111 INFO L120 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 [2019-11-28 03:52:45,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:45,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:45,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:45,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:45,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:45,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:45,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:45,128 INFO L120 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 [2019-11-28 03:52:45,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:45,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:45,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:45,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:45,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:45,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:45,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:45,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:45,143 INFO L120 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 [2019-11-28 03:52:45,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:45,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:45,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:45,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:45,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:45,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:45,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:45,159 INFO L120 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 [2019-11-28 03:52:45,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:45,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:45,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:45,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:45,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:45,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:45,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:45,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:45,171 INFO L120 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 [2019-11-28 03:52:45,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:45,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:45,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:45,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:45,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:45,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:45,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:45,191 INFO L120 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 [2019-11-28 03:52:45,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:45,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:45,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:45,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:45,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:45,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:45,220 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:45,233 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-28 03:52:45,233 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:45,239 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:45,244 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:45,244 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:45,244 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, ~N~0) = -1*ULTIMATE.start_sum_~i~0 + 1*~N~0 Supporting invariants [] [2019-11-28 03:52:45,260 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:52:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:45,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:45,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:45,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:45,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:45,315 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 [2019-11-28 03:52:45,315 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 03:52:45,326 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 41 states and 47 transitions. Complement of second has 4 states. [2019-11-28 03:52:45,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:52:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:52:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-11-28 03:52:45,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 2 letters. [2019-11-28 03:52:45,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:45,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 23 letters. Loop has 2 letters. [2019-11-28 03:52:45,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:45,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 4 letters. [2019-11-28 03:52:45,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:45,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2019-11-28 03:52:45,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:52:45,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 24 states and 26 transitions. [2019-11-28 03:52:45,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:52:45,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 03:52:45,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2019-11-28 03:52:45,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:45,334 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-28 03:52:45,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2019-11-28 03:52:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-28 03:52:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:52:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-11-28 03:52:45,337 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-28 03:52:45,337 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-28 03:52:45,337 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:52:45,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2019-11-28 03:52:45,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:52:45,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:45,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:45,341 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:45,341 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:45,341 INFO L794 eck$LassoCheckResult]: Stem: 1205#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1204#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 1203#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1199#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1200#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1201#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1202#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1214#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1213#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1212#L11-3 assume !(sum_~i~0 < ~N~0); 1195#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1196#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1208#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1209#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1210#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1211#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1217#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1216#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1215#L11-8 assume !(sum_~i~0 < ~N~0); 1206#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1207#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 1197#L32-3 [2019-11-28 03:52:45,341 INFO L796 eck$LassoCheckResult]: Loop: 1197#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 1198#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 1197#L32-3 [2019-11-28 03:52:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:45,342 INFO L82 PathProgramCache]: Analyzing trace with hash 972468242, now seen corresponding path program 3 times [2019-11-28 03:52:45,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:45,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807047873] [2019-11-28 03:52:45,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:45,413 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:45,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:45,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 5 times [2019-11-28 03:52:45,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:45,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134285198] [2019-11-28 03:52:45,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:45,421 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:45,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1760888524, now seen corresponding path program 2 times [2019-11-28 03:52:45,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:45,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316462191] [2019-11-28 03:52:45,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:45,464 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:46,242 WARN L192 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 159 [2019-11-28 03:52:47,059 WARN L192 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2019-11-28 03:52:47,063 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:47,063 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:47,064 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:47,064 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:47,064 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:47,064 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:47,064 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:47,065 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:47,065 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum.i_Iteration11_Lasso [2019-11-28 03:52:47,065 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:47,065 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:47,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,270 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-28 03:52:47,800 WARN L192 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-11-28 03:52:47,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:47,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:48,244 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-11-28 03:52:48,932 WARN L192 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-28 03:52:49,034 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:49,034 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:49,038 INFO L120 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 [2019-11-28 03:52:49,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:49,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:49,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:49,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:49,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:49,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:49,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:49,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:49,047 INFO L120 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 [2019-11-28 03:52:49,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:49,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:49,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:49,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:49,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:49,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:49,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:49,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:49,057 INFO L120 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 [2019-11-28 03:52:49,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:49,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:49,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:49,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:49,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:49,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:49,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:49,069 INFO L120 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 [2019-11-28 03:52:49,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:49,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:49,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:49,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:49,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:49,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:49,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:49,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:49,078 INFO L120 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 [2019-11-28 03:52:49,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:49,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:49,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:49,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:49,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:49,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:49,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:49,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:49,087 INFO L120 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 [2019-11-28 03:52:49,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:49,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:49,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:49,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:49,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:49,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:49,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:49,102 INFO L120 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 [2019-11-28 03:52:49,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:49,104 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:52:49,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:49,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:49,115 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 03:52:49,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:49,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:49,147 INFO L120 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 [2019-11-28 03:52:49,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:49,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:49,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:49,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:49,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:49,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:49,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:49,166 INFO L120 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 [2019-11-28 03:52:49,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:49,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:49,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:49,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:49,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:49,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:49,188 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:49,219 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-11-28 03:52:49,219 INFO L444 ModelExtractionUtils]: 1 out of 28 variables were initially zero. Simplification set additionally 24 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:49,223 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:52:49,225 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:49,225 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:49,225 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ~N~0) = -1*ULTIMATE.start_main_~i~1 + 1*~N~0 Supporting invariants [] [2019-11-28 03:52:49,270 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-11-28 03:52:49,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:49,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:49,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:49,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:49,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:49,331 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 [2019-11-28 03:52:49,331 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 25 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-28 03:52:49,338 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 25 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 28 transitions. Complement of second has 4 states. [2019-11-28 03:52:49,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:52:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:52:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-28 03:52:49,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 21 letters. Loop has 2 letters. [2019-11-28 03:52:49,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:49,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 23 letters. Loop has 2 letters. [2019-11-28 03:52:49,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:49,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 21 letters. Loop has 4 letters. [2019-11-28 03:52:49,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:49,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2019-11-28 03:52:49,341 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:52:49,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-11-28 03:52:49,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:52:49,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:52:49,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:52:49,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:49,342 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:52:49,342 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:52:49,342 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:52:49,342 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 03:52:49,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:52:49,342 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:52:49,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:52:49,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:52:49 BoogieIcfgContainer [2019-11-28 03:52:49,351 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:52:49,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:52:49,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:52:49,352 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:52:49,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:30" (3/4) ... [2019-11-28 03:52:49,356 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:52:49,356 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:52:49,361 INFO L168 Benchmark]: Toolchain (without parser) took 20109.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 364.9 MB). Free memory was 961.7 MB in the beginning and 957.7 MB in the end (delta: 4.1 MB). Peak memory consumption was 369.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:49,366 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:52:49,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.05 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:49,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:49,368 INFO L168 Benchmark]: Boogie Preprocessor took 27.08 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:52:49,370 INFO L168 Benchmark]: RCFGBuilder took 384.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:49,371 INFO L168 Benchmark]: BuchiAutomizer took 19316.65 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 247.5 MB). Free memory was 1.1 GB in the beginning and 957.7 MB in the end (delta: 129.1 MB). Peak memory consumption was 376.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:49,371 INFO L168 Benchmark]: Witness Printer took 4.58 ms. Allocated memory is still 1.4 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:52:49,377 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.05 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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 110.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.08 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 384.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19316.65 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 247.5 MB). Free memory was 1.1 GB in the beginning and 957.7 MB in the end (delta: 129.1 MB). Peak memory consumption was 376.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.58 ms. Allocated memory is still 1.4 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 11 terminating modules (6 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[x] + -4 * i + -1 * x and consists of 5 locations. One deterministic module has affine ranking function -4 * i + -1 * x + unknown-#length-unknown[x] and consists of 4 locations. One deterministic module has affine ranking function 2 * i + -1 * x + -4 * i and consists of 13 locations. One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.2s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 17.2s. Construction of modules took 0.5s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 32 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 9. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 128 SDtfs, 186 SDslu, 96 SDs, 0 SdLazy, 442 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU6 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital374 mio100 ax100 hnf99 lsp110 ukn64 mio100 lsp52 div103 bol100 ite100 ukn100 eq167 hnf80 smp80 dnf221 smp59 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 66ms VariablesStem: 17 VariablesLoop: 8 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...