./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c 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/termination-memory-alloca/a.06-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash e6c4332f1874752b59e29803328ba77ee4005585 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: No Interpolants --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:33:12,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:33:12,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:33:12,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:33:12,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:33:12,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:33:12,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:33:12,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:33:12,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:33:12,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:33:12,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:33:12,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:33:12,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:33:12,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:33:12,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:33:12,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:33:12,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:33:12,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:33:12,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:33:12,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:33:12,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:33:12,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:33:12,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:33:12,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:33:12,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:33:12,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:33:12,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:33:12,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:33:12,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:33:12,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:33:12,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:33:12,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:33:12,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:33:12,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:33:12,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:33:12,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:33:12,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:33:12,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:33:12,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:33:12,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:33:12,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:33:12,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:33:12,430 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:33:12,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:33:12,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:33:12,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:33:12,432 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:33:12,432 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:33:12,433 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:33:12,433 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:33:12,433 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:33:12,433 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:33:12,433 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:33:12,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:33:12,434 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:33:12,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:33:12,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:33:12,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:33:12,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:33:12,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:33:12,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:33:12,435 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:33:12,436 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:33:12,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:33:12,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:33:12,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:33:12,436 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:33:12,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:33:12,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:33:12,437 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:33:12,437 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:33:12,438 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:33:12,438 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e6c4332f1874752b59e29803328ba77ee4005585 [2019-11-28 20:33:12,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:33:12,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:33:12,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:33:12,774 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:33:12,774 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:33:12,775 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2019-11-28 20:33:12,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77e19b56/b08c6b99f4104960bc301bf0a2956f9e/FLAG1efa651c1 [2019-11-28 20:33:13,397 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:33:13,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2019-11-28 20:33:13,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77e19b56/b08c6b99f4104960bc301bf0a2956f9e/FLAG1efa651c1 [2019-11-28 20:33:13,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77e19b56/b08c6b99f4104960bc301bf0a2956f9e [2019-11-28 20:33:13,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:33:13,691 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:33:13,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:33:13,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:33:13,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:33:13,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:33:13" (1/1) ... [2019-11-28 20:33:13,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16abc7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:13, skipping insertion in model container [2019-11-28 20:33:13,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:33:13" (1/1) ... [2019-11-28 20:33:13,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:33:13,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:33:14,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:33:14,198 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:33:14,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:33:14,300 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:33:14,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:14 WrapperNode [2019-11-28 20:33:14,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:33:14,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:33:14,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:33:14,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:33:14,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:14" (1/1) ... [2019-11-28 20:33:14,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:14" (1/1) ... [2019-11-28 20:33:14,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:33:14,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:33:14,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:33:14,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:33:14,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:14" (1/1) ... [2019-11-28 20:33:14,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:14" (1/1) ... [2019-11-28 20:33:14,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:14" (1/1) ... [2019-11-28 20:33:14,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:14" (1/1) ... [2019-11-28 20:33:14,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:14" (1/1) ... [2019-11-28 20:33:14,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:14" (1/1) ... [2019-11-28 20:33:14,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:14" (1/1) ... [2019-11-28 20:33:14,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:33:14,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:33:14,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:33:14,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:33:14,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:14" (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 20:33:14,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:33:14,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:33:14,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:33:14,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:33:14,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:33:14,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:33:14,861 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:33:14,862 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 20:33:14,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:33:14 BoogieIcfgContainer [2019-11-28 20:33:14,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:33:14,864 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:33:14,864 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:33:14,869 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:33:14,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:33:14,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:33:13" (1/3) ... [2019-11-28 20:33:14,872 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2eb30ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:33:14, skipping insertion in model container [2019-11-28 20:33:14,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:33:14,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:33:14" (2/3) ... [2019-11-28 20:33:14,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2eb30ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:33:14, skipping insertion in model container [2019-11-28 20:33:14,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:33:14,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:33:14" (3/3) ... [2019-11-28 20:33:14,876 INFO L371 chiAutomizerObserver]: Analyzing ICFG a.06-alloca.i [2019-11-28 20:33:14,925 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:33:14,926 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:33:14,926 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:33:14,926 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:33:14,928 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:33:14,928 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:33:14,928 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:33:14,928 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:33:14,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 20:33:14,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 20:33:14,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:14,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:14,980 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:33:14,980 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:33:14,980 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:33:14,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 20:33:14,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 20:33:14,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:14,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:14,983 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:33:14,983 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:33:14,990 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 4#L557-20true [2019-11-28 20:33:14,990 INFO L796 eck$LassoCheckResult]: Loop: 4#L557-20true call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 7#L557-1true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 10#L557-3true test_fun_#t~short14 := test_fun_#t~short9; 13#L557-4true assume test_fun_#t~short14; 3#L557-9true test_fun_#t~short18 := test_fun_#t~short14; 5#L557-10true assume !test_fun_#t~short18; 8#L557-12true test_fun_#t~short20 := test_fun_#t~short18; 9#L557-13true assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 14#L557-15true test_fun_#t~short22 := test_fun_#t~short20; 16#L557-16true assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 20#L557-18true assume !!test_fun_#t~short22;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem11;havoc test_fun_#t~short22;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short20;havoc test_fun_#t~mem6;havoc test_fun_#t~mem16;havoc test_fun_#t~mem17;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~short18;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 4#L557-20true [2019-11-28 20:33:14,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:14,998 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 20:33:15,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:15,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344480701] [2019-11-28 20:33:15,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,253 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:15,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:15,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1442805661, now seen corresponding path program 1 times [2019-11-28 20:33:15,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:15,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337206925] [2019-11-28 20:33:15,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:15,339 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 20:33:15,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337206925] [2019-11-28 20:33:15,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:33:15,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:33:15,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160635819] [2019-11-28 20:33:15,348 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:33:15,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:33:15,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:33:15,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:33:15,369 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2019-11-28 20:33:15,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:33:15,439 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-11-28 20:33:15,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:33:15,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-11-28 20:33:15,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-11-28 20:33:15,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 30 transitions. [2019-11-28 20:33:15,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 20:33:15,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 20:33:15,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2019-11-28 20:33:15,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:33:15,451 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-28 20:33:15,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2019-11-28 20:33:15,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-11-28 20:33:15,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 20:33:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-28 20:33:15,479 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 20:33:15,479 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 20:33:15,480 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:33:15,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-28 20:33:15,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-28 20:33:15,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:15,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:15,481 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:33:15,482 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:33:15,482 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 68#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 61#L557-20 [2019-11-28 20:33:15,482 INFO L796 eck$LassoCheckResult]: Loop: 61#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 62#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 64#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 67#L557-4 assume test_fun_#t~short14; 59#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 60#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 63#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 65#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 66#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 70#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 72#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem11;havoc test_fun_#t~short22;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short20;havoc test_fun_#t~mem6;havoc test_fun_#t~mem16;havoc test_fun_#t~mem17;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~short18;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 61#L557-20 [2019-11-28 20:33:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:15,483 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 20:33:15,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:15,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676061674] [2019-11-28 20:33:15,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,580 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:15,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:15,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1500063963, now seen corresponding path program 1 times [2019-11-28 20:33:15,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:15,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792875107] [2019-11-28 20:33:15,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,627 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:15,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:15,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1876539869, now seen corresponding path program 1 times [2019-11-28 20:33:15,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:15,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962603169] [2019-11-28 20:33:15,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:15,749 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:16,232 WARN L192 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2019-11-28 20:33:17,061 WARN L192 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 103 [2019-11-28 20:33:17,389 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-28 20:33:17,407 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:33:17,408 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:33:17,408 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:33:17,409 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:33:17,409 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:33:17,409 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:17,410 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:33:17,410 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:33:17,410 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration2_Lasso [2019-11-28 20:33:17,410 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:33:17,411 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:33:17,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 20:33:17,445 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 20:33:17,449 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 20:33:17,457 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 20:33:17,459 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 20:33:17,462 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 20:33:17,465 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 20:33:17,468 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 20:33:17,472 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 20:33:17,475 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 20:33:17,478 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 20:33:17,480 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 20:33:17,482 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 20:33:18,198 WARN L192 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2019-11-28 20:33:18,426 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-28 20:33:18,427 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 20:33:18,432 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 20:33:18,434 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 20:33:18,436 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 20:33:18,440 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 20:33:18,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 20:33:18,449 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 20:33:18,452 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 20:33:18,455 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 20:33:18,458 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 20:33:18,460 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 20:33:18,463 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 20:33:18,465 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 20:33:18,468 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 20:33:18,470 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 20:33:18,473 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 20:33:18,475 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 20:33:18,798 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-11-28 20:33:19,248 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:33:19,254 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) [2019-11-28 20:33:19,271 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:19,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:19,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:19,284 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,297 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 20:33:19,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:19,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:19,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:19,305 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 20:33:19,322 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 20:33:19,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:19,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:19,327 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 20:33:19,330 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 20:33:19,348 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 20:33:19,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:19,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:19,354 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 20:33:19,357 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,372 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 20:33:19,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:19,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:19,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:19,382 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 20:33:19,401 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 20:33:19,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:19,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:19,405 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 20:33:19,407 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) [2019-11-28 20:33:19,427 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 20:33:19,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:19,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:19,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,434 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 20:33:19,458 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 20:33:19,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:19,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,475 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) [2019-11-28 20:33:19,491 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 20:33:19,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:19,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:19,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,498 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 20:33:19,515 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 20:33:19,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:19,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:19,519 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 20:33:19,522 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) [2019-11-28 20:33:19,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 [2019-11-28 20:33:19,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:19,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:19,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,550 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 20:33:19,567 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 20:33:19,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:19,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:19,571 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 20:33:19,575 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 20:33:19,591 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 20:33:19,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:19,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:19,609 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 20:33:19,615 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 20:33:19,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:19,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:19,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 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,647 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 20:33:19,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:19,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:19,659 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:33:19,677 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 20:33:19,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:19,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,693 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 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,709 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 20:33:19,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:19,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:19,721 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 20:33:19,738 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 20:33:19,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:19,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:19,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:19,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:19,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:19,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,776 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:33:19,919 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-28 20:33:19,919 INFO L444 ModelExtractionUtils]: 14 out of 40 variables were initially zero. Simplification set additionally 23 variables to zero. 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) [2019-11-28 20:33:19,980 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:19,985 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:33:19,985 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:33:19,986 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2019-11-28 20:33:20,206 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-11-28 20:33:20,216 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:33:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:20,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:33:20,269 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:20,299 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:33:20,301 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:20,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:20,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:20,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:20,439 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 20:33:20,443 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-28 20:33:20,444 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7 Second operand 6 states. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 20:33:20,775 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 73 states and 101 transitions. Complement of second has 12 states. [2019-11-28 20:33:20,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 20:33:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 20:33:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2019-11-28 20:33:20,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 11 letters. [2019-11-28 20:33:20,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:20,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 13 letters. Loop has 11 letters. [2019-11-28 20:33:20,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:20,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 22 letters. [2019-11-28 20:33:20,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:33:20,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 101 transitions. [2019-11-28 20:33:20,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-11-28 20:33:20,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 66 states and 92 transitions. [2019-11-28 20:33:20,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-28 20:33:20,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-28 20:33:20,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 92 transitions. [2019-11-28 20:33:20,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:33:20,800 INFO L688 BuchiCegarLoop]: Abstraction has 66 states and 92 transitions. [2019-11-28 20:33:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 92 transitions. [2019-11-28 20:33:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2019-11-28 20:33:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:33:20,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2019-11-28 20:33:20,806 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2019-11-28 20:33:20,806 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2019-11-28 20:33:20,806 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:33:20,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2019-11-28 20:33:20,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-28 20:33:20,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:20,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:20,808 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:33:20,809 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:33:20,809 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 409#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 410#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 393#L557-1 [2019-11-28 20:33:20,809 INFO L796 eck$LassoCheckResult]: Loop: 393#L557-1 assume !test_fun_#t~short9; 400#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 407#L557-4 assume test_fun_#t~short14; 423#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 396#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 397#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 403#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 405#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 415#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 418#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem11;havoc test_fun_#t~short22;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short20;havoc test_fun_#t~mem6;havoc test_fun_#t~mem16;havoc test_fun_#t~mem17;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~short18;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 392#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 393#L557-1 [2019-11-28 20:33:20,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:20,810 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-28 20:33:20,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:20,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351068989] [2019-11-28 20:33:20,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:20,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:20,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:20,850 INFO L82 PathProgramCache]: Analyzing trace with hash 962628681, now seen corresponding path program 1 times [2019-11-28 20:33:20,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:20,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172137708] [2019-11-28 20:33:20,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:20,899 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 20:33:20,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172137708] [2019-11-28 20:33:20,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:33:20,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:33:20,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178261277] [2019-11-28 20:33:20,901 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:33:20,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:33:20,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:33:20,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:33:20,907 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-11-28 20:33:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:33:20,968 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2019-11-28 20:33:20,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:33:20,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 82 transitions. [2019-11-28 20:33:20,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-28 20:33:20,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 82 transitions. [2019-11-28 20:33:20,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-28 20:33:20,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 20:33:20,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 82 transitions. [2019-11-28 20:33:20,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:33:20,975 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 82 transitions. [2019-11-28 20:33:20,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 82 transitions. [2019-11-28 20:33:20,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2019-11-28 20:33:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:33:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-11-28 20:33:20,986 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-28 20:33:20,986 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-28 20:33:20,986 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:33:20,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2019-11-28 20:33:20,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 20:33:20,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:20,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:20,990 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:33:20,990 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:33:20,991 INFO L794 eck$LassoCheckResult]: Stem: 526#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 520#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 521#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 506#L557-1 [2019-11-28 20:33:20,991 INFO L796 eck$LassoCheckResult]: Loop: 506#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 511#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 518#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 522#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 529#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 501#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 502#L557-10 assume !test_fun_#t~short18; 509#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 514#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 516#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 524#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 527#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem11;havoc test_fun_#t~short22;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short20;havoc test_fun_#t~mem6;havoc test_fun_#t~mem16;havoc test_fun_#t~mem17;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~short18;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 505#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 506#L557-1 [2019-11-28 20:33:20,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:20,992 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-11-28 20:33:20,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:20,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264331307] [2019-11-28 20:33:20,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:21,059 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:21,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:21,060 INFO L82 PathProgramCache]: Analyzing trace with hash 623036047, now seen corresponding path program 1 times [2019-11-28 20:33:21,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:21,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152985286] [2019-11-28 20:33:21,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:21,108 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 20:33:21,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152985286] [2019-11-28 20:33:21,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:33:21,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:33:21,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549318210] [2019-11-28 20:33:21,110 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:33:21,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:33:21,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:33:21,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:33:21,111 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2019-11-28 20:33:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:33:21,158 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2019-11-28 20:33:21,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:33:21,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 78 transitions. [2019-11-28 20:33:21,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-28 20:33:21,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 78 transitions. [2019-11-28 20:33:21,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 20:33:21,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 20:33:21,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 78 transitions. [2019-11-28 20:33:21,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:33:21,162 INFO L688 BuchiCegarLoop]: Abstraction has 58 states and 78 transitions. [2019-11-28 20:33:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 78 transitions. [2019-11-28 20:33:21,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2019-11-28 20:33:21,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:33:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-11-28 20:33:21,167 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-28 20:33:21,167 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-28 20:33:21,167 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:33:21,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2019-11-28 20:33:21,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-28 20:33:21,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:21,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:21,169 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:33:21,169 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:33:21,169 INFO L794 eck$LassoCheckResult]: Stem: 638#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 631#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 632#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 612#L557-1 [2019-11-28 20:33:21,170 INFO L796 eck$LassoCheckResult]: Loop: 612#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 620#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 629#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 633#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 641#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 607#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 608#L557-10 assume !test_fun_#t~short18; 615#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 625#L557-13 assume !test_fun_#t~short20; 626#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 636#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 639#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem11;havoc test_fun_#t~short22;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short20;havoc test_fun_#t~mem6;havoc test_fun_#t~mem16;havoc test_fun_#t~mem17;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~short18;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 611#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 612#L557-1 [2019-11-28 20:33:21,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:21,170 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2019-11-28 20:33:21,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:21,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930381540] [2019-11-28 20:33:21,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:21,202 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:21,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:21,203 INFO L82 PathProgramCache]: Analyzing trace with hash 624883089, now seen corresponding path program 1 times [2019-11-28 20:33:21,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:21,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459034850] [2019-11-28 20:33:21,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:21,257 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 20:33:21,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459034850] [2019-11-28 20:33:21,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:33:21,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:33:21,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994957933] [2019-11-28 20:33:21,259 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:33:21,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:33:21,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:33:21,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:33:21,260 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 17 Second operand 4 states. [2019-11-28 20:33:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:33:21,299 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-11-28 20:33:21,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:33:21,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 64 transitions. [2019-11-28 20:33:21,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 20:33:21,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 39 states and 46 transitions. [2019-11-28 20:33:21,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 20:33:21,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 20:33:21,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2019-11-28 20:33:21,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:33:21,303 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-28 20:33:21,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2019-11-28 20:33:21,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 20:33:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:33:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2019-11-28 20:33:21,309 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-28 20:33:21,309 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-28 20:33:21,309 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:33:21,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2019-11-28 20:33:21,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 20:33:21,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:21,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:21,313 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:33:21,313 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:33:21,313 INFO L794 eck$LassoCheckResult]: Stem: 740#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 734#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 735#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 719#L557-1 [2019-11-28 20:33:21,314 INFO L796 eck$LassoCheckResult]: Loop: 719#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 724#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 732#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 736#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 743#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 714#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 715#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 722#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 727#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 729#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 738#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 741#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem11;havoc test_fun_#t~short22;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short20;havoc test_fun_#t~mem6;havoc test_fun_#t~mem16;havoc test_fun_#t~mem17;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~short18;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 718#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 719#L557-1 [2019-11-28 20:33:21,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:21,314 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 4 times [2019-11-28 20:33:21,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:21,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366391154] [2019-11-28 20:33:21,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:21,376 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:21,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:21,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1151971315, now seen corresponding path program 1 times [2019-11-28 20:33:21,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:21,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111343552] [2019-11-28 20:33:21,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:21,494 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 20:33:21,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111343552] [2019-11-28 20:33:21,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:33:21,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:33:21,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225833580] [2019-11-28 20:33:21,497 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:33:21,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:33:21,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:33:21,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:33:21,498 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-11-28 20:33:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:33:21,724 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-11-28 20:33:21,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:33:21,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 98 transitions. [2019-11-28 20:33:21,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2019-11-28 20:33:21,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 75 states and 82 transitions. [2019-11-28 20:33:21,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-11-28 20:33:21,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-11-28 20:33:21,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 82 transitions. [2019-11-28 20:33:21,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:33:21,731 INFO L688 BuchiCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-11-28 20:33:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 82 transitions. [2019-11-28 20:33:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2019-11-28 20:33:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:33:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-11-28 20:33:21,739 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-11-28 20:33:21,739 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-11-28 20:33:21,739 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:33:21,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2019-11-28 20:33:21,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-28 20:33:21,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:21,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:21,740 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:33:21,741 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:33:21,741 INFO L794 eck$LassoCheckResult]: Stem: 894#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 886#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 887#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 871#L557-1 [2019-11-28 20:33:21,741 INFO L796 eck$LassoCheckResult]: Loop: 871#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 876#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 884#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 897#L557-6 assume !test_fun_#t~short13; 898#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 866#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 867#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 874#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 880#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 882#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 892#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 895#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem11;havoc test_fun_#t~short22;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short20;havoc test_fun_#t~mem6;havoc test_fun_#t~mem16;havoc test_fun_#t~mem17;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~short18;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 870#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 871#L557-1 [2019-11-28 20:33:21,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:21,742 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 5 times [2019-11-28 20:33:21,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:21,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487976288] [2019-11-28 20:33:21,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:21,801 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:21,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:21,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1544998325, now seen corresponding path program 1 times [2019-11-28 20:33:21,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:21,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028371162] [2019-11-28 20:33:21,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:21,837 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 20:33:21,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028371162] [2019-11-28 20:33:21,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:33:21,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:33:21,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653676529] [2019-11-28 20:33:21,839 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:33:21,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:33:21,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:33:21,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:33:21,840 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-28 20:33:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:33:21,892 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-11-28 20:33:21,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:33:21,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 54 transitions. [2019-11-28 20:33:21,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 20:33:21,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 39 states and 42 transitions. [2019-11-28 20:33:21,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 20:33:21,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 20:33:21,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 42 transitions. [2019-11-28 20:33:21,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:33:21,895 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 20:33:21,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 42 transitions. [2019-11-28 20:33:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 20:33:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:33:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 20:33:21,900 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 20:33:21,900 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 20:33:21,900 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:33:21,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2019-11-28 20:33:21,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-28 20:33:21,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:33:21,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:33:21,902 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:33:21,902 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:33:21,903 INFO L794 eck$LassoCheckResult]: Stem: 995#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 990#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 991#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 975#L557-1 [2019-11-28 20:33:21,904 INFO L796 eck$LassoCheckResult]: Loop: 975#L557-1 assume !test_fun_#t~short9; 980#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 988#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 992#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 998#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 970#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 971#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 978#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 983#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 985#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 993#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 996#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem19;havoc test_fun_#t~mem8;havoc test_fun_#t~mem11;havoc test_fun_#t~short22;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short20;havoc test_fun_#t~mem6;havoc test_fun_#t~mem16;havoc test_fun_#t~mem17;havoc test_fun_#t~mem21;havoc test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short14;havoc test_fun_#t~short18;havoc test_fun_#t~mem10;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 974#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 975#L557-1 [2019-11-28 20:33:21,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:21,904 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 6 times [2019-11-28 20:33:21,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:21,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306602889] [2019-11-28 20:33:21,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:21,942 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:21,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:21,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1738777329, now seen corresponding path program 1 times [2019-11-28 20:33:21,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:21,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590905218] [2019-11-28 20:33:21,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:21,996 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:21,999 INFO L82 PathProgramCache]: Analyzing trace with hash -403715764, now seen corresponding path program 1 times [2019-11-28 20:33:21,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:33:22,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008491298] [2019-11-28 20:33:22,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:33:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:33:22,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:33:22,520 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 95 [2019-11-28 20:33:22,895 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-11-28 20:33:23,502 WARN L192 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 114 [2019-11-28 20:33:24,235 WARN L192 SmtUtils]: Spent 729.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-28 20:33:24,245 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:33:24,245 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:33:24,245 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:33:24,245 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:33:24,246 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:33:24,246 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:24,246 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:33:24,246 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:33:24,246 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration8_Lasso [2019-11-28 20:33:24,246 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:33:24,246 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:33:24,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 20:33:24,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 20:33:25,744 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2019-11-28 20:33:26,406 WARN L192 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-11-28 20:33:26,407 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 20:33:26,409 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 20:33:26,411 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 20:33:26,413 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 20:33:26,415 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 20:33:26,417 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 20:33:26,419 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 20:33:26,421 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 20:33:26,430 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 20:33:26,431 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 20:33:26,432 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 20:33:26,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 20:33:26,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 20:33:26,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 20:33:26,443 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 20:33:26,445 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 20:33:26,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 20:33:26,461 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 20:33:26,462 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 20:33:26,464 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 20:33:26,476 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 20:33:26,477 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 20:33:26,479 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 20:33:26,480 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 20:33:26,482 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 20:33:26,483 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 20:33:26,638 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-11-28 20:33:26,745 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-11-28 20:33:26,928 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-28 20:33:27,432 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-28 20:33:27,628 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-28 20:33:27,908 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:33:27,908 INFO L489 LassoAnalysis]: Using template 'affine'. 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 20:33:27,921 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 20:33:27,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:27,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:33:27,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:27,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:27,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:27,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:33:27,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:33:27,929 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 20:33:27,936 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 20:33:27,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:27,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:33:27,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:33:27,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:27,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:33:27,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:33:27,951 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 20:33:27,957 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:27,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:33:27,960 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 20:33:27,960 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 20:33:27,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:33:27,991 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-28 20:33:27,991 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-28 20:33:28,084 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:33:28,139 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 20:33:28,139 INFO L444 ModelExtractionUtils]: 60 out of 76 variables were initially zero. Simplification set additionally 13 variables to zero. 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:33:28,143 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:33:28,146 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-28 20:33:28,146 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:33:28,147 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 4294967293 Supporting invariants [] [2019-11-28 20:33:28,387 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-11-28 20:33:28,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 20:33:28,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:33:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:28,419 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:33:28,420 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:33:28,435 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:33:28,436 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:33:28,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:28,574 INFO L343 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2019-11-28 20:33:28,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 109 [2019-11-28 20:33:28,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:28,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:28,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:28,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:28,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:28,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:28,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:28,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:28,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:28,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:33:28,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:33:28,612 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: No Interpolants at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.getInterpolants(InterpolatingTraceCheck.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:738) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:551) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 20:33:28,617 INFO L168 Benchmark]: Toolchain (without parser) took 14925.52 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 365.4 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -202.6 MB). Peak memory consumption was 162.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:28,618 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:33:28,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 607.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:28,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:28,620 INFO L168 Benchmark]: Boogie Preprocessor took 29.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:33:28,620 INFO L168 Benchmark]: RCFGBuilder took 479.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:28,621 INFO L168 Benchmark]: BuchiAutomizer took 13750.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -79.3 MB). Peak memory consumption was 156.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:33:28,624 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 607.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 479.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13750.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -79.3 MB). Peak memory consumption was 156.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: No Interpolants de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: No Interpolants: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.getInterpolants(InterpolatingTraceCheck.java:155) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...