./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 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/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 860b8b475b7671f4fb04d10fe02f66a14a39a96b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:22:11,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:22:11,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:22:11,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:22:11,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:22:11,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:22:11,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:22:11,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:22:11,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:22:11,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:22:11,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:22:11,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:22:11,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:22:11,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:22:11,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:22:11,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:22:11,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:22:11,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:22:11,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:22:11,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:22:11,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:22:11,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:22:11,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:22:11,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:22:11,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:22:11,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:22:11,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:22:11,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:22:11,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:22:11,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:22:11,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:22:11,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:22:11,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:22:11,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:22:11,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:22:11,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:22:11,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:22:11,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:22:11,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:22:11,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:22:11,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:22:11,728 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-19 22:22:11,763 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:22:11,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:22:11,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:22:11,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:22:11,765 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:22:11,766 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 22:22:11,766 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 22:22:11,766 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 22:22:11,766 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 22:22:11,767 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 22:22:11,767 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 22:22:11,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:22:11,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:22:11,768 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:22:11,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:22:11,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:22:11,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:22:11,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 22:22:11,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 22:22:11,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 22:22:11,770 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:22:11,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:22:11,770 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 22:22:11,770 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:22:11,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 22:22:11,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:22:11,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:22:11,772 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 22:22:11,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:22:11,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:22:11,772 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 22:22:11,773 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 22:22:11,774 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 860b8b475b7671f4fb04d10fe02f66a14a39a96b [2019-11-19 22:22:12,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:22:12,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:22:12,081 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:22:12,082 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:22:12,083 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:22:12,083 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2019-11-19 22:22:12,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc01dcd3d/7f43560c3f174abcacdddcda4066045c/FLAG26f46cb32 [2019-11-19 22:22:12,594 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:22:12,595 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2019-11-19 22:22:12,602 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc01dcd3d/7f43560c3f174abcacdddcda4066045c/FLAG26f46cb32 [2019-11-19 22:22:12,978 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc01dcd3d/7f43560c3f174abcacdddcda4066045c [2019-11-19 22:22:12,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:22:12,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:22:12,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:22:12,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:22:12,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:22:12,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:22:12" (1/1) ... [2019-11-19 22:22:12,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b164a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:12, skipping insertion in model container [2019-11-19 22:22:12,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:22:12" (1/1) ... [2019-11-19 22:22:13,001 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:22:13,023 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:22:13,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:22:13,258 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:22:13,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:22:13,308 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:22:13,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:13 WrapperNode [2019-11-19 22:22:13,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:22:13,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:22:13,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:22:13,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:22:13,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:13" (1/1) ... [2019-11-19 22:22:13,381 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:13" (1/1) ... [2019-11-19 22:22:13,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:22:13,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:22:13,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:22:13,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:22:13,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:13" (1/1) ... [2019-11-19 22:22:13,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:13" (1/1) ... [2019-11-19 22:22:13,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:13" (1/1) ... [2019-11-19 22:22:13,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:13" (1/1) ... [2019-11-19 22:22:13,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:13" (1/1) ... [2019-11-19 22:22:13,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:13" (1/1) ... [2019-11-19 22:22:13,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:13" (1/1) ... [2019-11-19 22:22:13,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:22:13,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:22:13,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:22:13,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:22:13,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:13" (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-19 22:22:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 22:22:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:22:13,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:22:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 22:22:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:22:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:22:13,746 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:22:13,746 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-19 22:22:13,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:22:13 BoogieIcfgContainer [2019-11-19 22:22:13,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:22:13,748 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 22:22:13,748 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 22:22:13,760 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 22:22:13,761 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:22:13,761 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 10:22:12" (1/3) ... [2019-11-19 22:22:13,762 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ead275b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:22:13, skipping insertion in model container [2019-11-19 22:22:13,763 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:22:13,763 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:22:13" (2/3) ... [2019-11-19 22:22:13,764 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ead275b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:22:13, skipping insertion in model container [2019-11-19 22:22:13,764 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:22:13,764 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:22:13" (3/3) ... [2019-11-19 22:22:13,765 INFO L371 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2019-11-19 22:22:13,815 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 22:22:13,816 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 22:22:13,816 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 22:22:13,816 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:22:13,816 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:22:13,817 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 22:22:13,817 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:22:13,817 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 22:22:13,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-19 22:22:13,851 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-11-19 22:22:13,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:22:13,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:22:13,858 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:22:13,858 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:22:13,858 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 22:22:13,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-19 22:22:13,860 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-11-19 22:22:13,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:22:13,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:22:13,861 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:22:13,861 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:22:13,869 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 4#L19-3true [2019-11-19 22:22:13,869 INFO L796 eck$LassoCheckResult]: Loop: 4#L19-3true assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 6#L19-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 4#L19-3true [2019-11-19 22:22:13,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:13,874 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-19 22:22:13,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:13,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846726639] [2019-11-19 22:22:13,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:14,007 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:14,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:14,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-19 22:22:14,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:14,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018524940] [2019-11-19 22:22:14,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:14,030 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:14,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-19 22:22:14,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:14,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403595519] [2019-11-19 22:22:14,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:14,089 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:14,278 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:22:14,279 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:22:14,279 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:22:14,280 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:22:14,280 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:22:14,280 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:22:14,280 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:22:14,280 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:22:14,281 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration1_Lasso [2019-11-19 22:22:14,281 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:22:14,281 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:22:14,305 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-19 22:22:14,313 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-19 22:22:14,385 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-19 22:22:14,389 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-19 22:22:14,393 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-19 22:22:14,398 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-19 22:22:14,404 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-19 22:22:14,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-19 22:22:14,412 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-19 22:22:14,416 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-19 22:22:14,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-19 22:22:14,423 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-19 22:22:14,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-19 22:22:14,617 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:22:14,623 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-19 22:22:14,631 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-19 22:22:14,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:22:14,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:22:14,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:22:14,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:22:14,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:22:14,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:22:14,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:22:14,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:22:14,655 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-19 22:22:14,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:22:14,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:22:14,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:22:14,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:22:14,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:22:14,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:22:14,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:22:14,661 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:22:14,671 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-19 22:22:14,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:22:14,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:22:14,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:22:14,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:22:14,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:22:14,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:22:14,696 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:22:14,708 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-19 22:22:14,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:22:14,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:22:14,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:22:14,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:22:14,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:22:14,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:22:14,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:22:14,715 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-19 22:22:14,726 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-19 22:22:14,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:22:14,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:22:14,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:22:14,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:22:14,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:22:14,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:22:14,737 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-19 22:22:14,752 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-19 22:22:14,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:22:14,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:22:14,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:22:14,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:22:14,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:22:14,771 INFO L402 nArgumentSynthesizer]: A total of 2 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-19 22:22:14,785 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:22:14,832 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-19 22:22:14,832 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:22:14,842 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:22:14,845 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:22:14,845 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:22:14,846 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_1) = -2*ULTIMATE.start_main_~i~0 + 21*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_1 Supporting invariants [] [2019-11-19 22:22:14,855 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-19 22:22:14,864 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 22:22:14,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:14,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:22:14,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:22:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:14,926 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:22:14,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:22:14,951 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-19 22:22:14,968 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-19 22:22:14,970 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-11-19 22:22:15,029 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 25 states and 35 transitions. Complement of second has 8 states. [2019-11-19 22:22:15,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-19 22:22:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:22:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-11-19 22:22:15,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-19 22:22:15,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:22:15,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-19 22:22:15,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:22:15,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-19 22:22:15,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:22:15,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2019-11-19 22:22:15,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:15,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 7 states and 9 transitions. [2019-11-19 22:22:15,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-19 22:22:15,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-19 22:22:15,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2019-11-19 22:22:15,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:22:15,046 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-19 22:22:15,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2019-11-19 22:22:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-19 22:22:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:22:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-19 22:22:15,074 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-19 22:22:15,074 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-19 22:22:15,074 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 22:22:15,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-11-19 22:22:15,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:15,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:22:15,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:22:15,076 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-19 22:22:15,076 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 22:22:15,076 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 84#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 85#L19-3 assume !(main_~i~0 < 11); 82#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 83#L26-2 [2019-11-19 22:22:15,077 INFO L796 eck$LassoCheckResult]: Loop: 83#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 83#L26-2 [2019-11-19 22:22:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:15,077 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-19 22:22:15,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:15,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898080817] [2019-11-19 22:22:15,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:15,134 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-19 22:22:15,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898080817] [2019-11-19 22:22:15,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:22:15,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:22:15,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101199251] [2019-11-19 22:22:15,138 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:22:15,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:15,139 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2019-11-19 22:22:15,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:15,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627916582] [2019-11-19 22:22:15,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:15,171 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:15,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:22:15,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:22:15,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:22:15,267 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-19 22:22:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:22:15,288 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-11-19 22:22:15,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:22:15,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-19 22:22:15,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:15,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-11-19 22:22:15,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 22:22:15,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 22:22:15,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-11-19 22:22:15,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:22:15,291 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-19 22:22:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-11-19 22:22:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-11-19 22:22:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 22:22:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-11-19 22:22:15,294 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-19 22:22:15,296 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-19 22:22:15,296 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 22:22:15,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-11-19 22:22:15,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:15,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:22:15,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:22:15,298 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:22:15,298 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 22:22:15,299 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 104#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 105#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 108#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 109#L19-3 assume !(main_~i~0 < 11); 106#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 107#L26-2 [2019-11-19 22:22:15,299 INFO L796 eck$LassoCheckResult]: Loop: 107#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 107#L26-2 [2019-11-19 22:22:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-19 22:22:15,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:15,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679439017] [2019-11-19 22:22:15,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:15,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679439017] [2019-11-19 22:22:15,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234735778] [2019-11-19 22:22:15,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:22:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:15,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:22:15,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:22:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:15,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:22:15,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-19 22:22:15,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941947909] [2019-11-19 22:22:15,402 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:22:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:15,407 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2019-11-19 22:22:15,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:15,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697384926] [2019-11-19 22:22:15,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:15,450 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:15,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:22:15,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:22:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:22:15,518 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-11-19 22:22:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:22:15,546 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-11-19 22:22:15,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:22:15,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-11-19 22:22:15,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:15,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2019-11-19 22:22:15,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 22:22:15,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 22:22:15,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2019-11-19 22:22:15,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:22:15,549 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-19 22:22:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2019-11-19 22:22:15,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-11-19 22:22:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-19 22:22:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-19 22:22:15,551 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-19 22:22:15,552 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-19 22:22:15,552 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 22:22:15,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-19 22:22:15,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:15,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:22:15,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:22:15,553 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-19 22:22:15,553 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 22:22:15,553 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 145#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 146#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 150#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 151#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 152#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 153#L19-3 assume !(main_~i~0 < 11); 147#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 148#L26-2 [2019-11-19 22:22:15,554 INFO L796 eck$LassoCheckResult]: Loop: 148#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 148#L26-2 [2019-11-19 22:22:15,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:15,554 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-11-19 22:22:15,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:15,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303463239] [2019-11-19 22:22:15,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:15,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303463239] [2019-11-19 22:22:15,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111137431] [2019-11-19 22:22:15,617 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:22:15,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:22:15,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:22:15,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:22:15,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:22:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:15,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:22:15,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-19 22:22:15,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525631667] [2019-11-19 22:22:15,696 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:22:15,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2019-11-19 22:22:15,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:15,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576364016] [2019-11-19 22:22:15,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:15,741 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:15,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:22:15,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:22:15,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:22:15,815 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-11-19 22:22:15,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:22:15,856 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-11-19 22:22:15,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:22:15,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-11-19 22:22:15,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:15,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-11-19 22:22:15,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 22:22:15,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 22:22:15,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-11-19 22:22:15,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:22:15,863 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-19 22:22:15,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-11-19 22:22:15,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-11-19 22:22:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-19 22:22:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-11-19 22:22:15,869 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-19 22:22:15,869 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-19 22:22:15,875 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 22:22:15,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-11-19 22:22:15,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:15,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:22:15,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:22:15,878 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-19 22:22:15,878 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 22:22:15,879 INFO L794 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 199#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 200#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 201#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 207#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 205#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 202#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 203#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 206#L19-3 assume !(main_~i~0 < 11); 197#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 198#L26-2 [2019-11-19 22:22:15,879 INFO L796 eck$LassoCheckResult]: Loop: 198#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 198#L26-2 [2019-11-19 22:22:15,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:15,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-11-19 22:22:15,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:15,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880369672] [2019-11-19 22:22:15,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:15,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:15,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880369672] [2019-11-19 22:22:15,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206917053] [2019-11-19 22:22:15,945 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:22:15,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 22:22:15,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:22:15,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:22:16,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:22:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:16,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:22:16,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-19 22:22:16,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725057335] [2019-11-19 22:22:16,018 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:22:16,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:16,019 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2019-11-19 22:22:16,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:16,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914391301] [2019-11-19 22:22:16,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:16,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:16,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:22:16,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:22:16,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:22:16,124 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-19 22:22:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:22:16,173 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-11-19 22:22:16,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:22:16,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2019-11-19 22:22:16,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:16,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2019-11-19 22:22:16,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 22:22:16,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 22:22:16,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2019-11-19 22:22:16,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:22:16,176 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 22:22:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2019-11-19 22:22:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-11-19 22:22:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-19 22:22:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-19 22:22:16,178 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-19 22:22:16,179 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-19 22:22:16,179 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 22:22:16,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-11-19 22:22:16,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:16,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:22:16,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:22:16,180 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-19 22:22:16,180 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 22:22:16,181 INFO L794 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 262#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 263#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 265#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 266#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 267#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 268#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 272#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 271#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 270#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 269#L19-3 assume !(main_~i~0 < 11); 260#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 261#L26-2 [2019-11-19 22:22:16,181 INFO L796 eck$LassoCheckResult]: Loop: 261#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 261#L26-2 [2019-11-19 22:22:16,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:16,181 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-11-19 22:22:16,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:16,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894863056] [2019-11-19 22:22:16,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:16,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894863056] [2019-11-19 22:22:16,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993536901] [2019-11-19 22:22:16,251 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:22:16,296 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 22:22:16,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:22:16,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:22:16,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:22:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:16,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:22:16,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-19 22:22:16,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656560331] [2019-11-19 22:22:16,320 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:22:16,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:16,320 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 5 times [2019-11-19 22:22:16,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:16,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077508083] [2019-11-19 22:22:16,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:16,344 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:16,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:22:16,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:22:16,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:22:16,408 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 8 states. [2019-11-19 22:22:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:22:16,454 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-11-19 22:22:16,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:22:16,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2019-11-19 22:22:16,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:16,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2019-11-19 22:22:16,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 22:22:16,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 22:22:16,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2019-11-19 22:22:16,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:22:16,461 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-19 22:22:16,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2019-11-19 22:22:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-11-19 22:22:16,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 22:22:16,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-19 22:22:16,463 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 22:22:16,464 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 22:22:16,464 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 22:22:16,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-19 22:22:16,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:16,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:22:16,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:22:16,467 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-11-19 22:22:16,467 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 22:22:16,467 INFO L794 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 336#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 337#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 338#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 339#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 340#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 342#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 348#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 347#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 346#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 345#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 344#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 343#L19-3 assume !(main_~i~0 < 11); 334#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 335#L26-2 [2019-11-19 22:22:16,467 INFO L796 eck$LassoCheckResult]: Loop: 335#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 335#L26-2 [2019-11-19 22:22:16,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:16,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-11-19 22:22:16,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:16,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466378229] [2019-11-19 22:22:16,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:16,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466378229] [2019-11-19 22:22:16,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278121708] [2019-11-19 22:22:16,555 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:22:16,608 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-19 22:22:16,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:22:16,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:22:16,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:22:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:16,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:22:16,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-19 22:22:16,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011689423] [2019-11-19 22:22:16,626 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:22:16,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:16,626 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 6 times [2019-11-19 22:22:16,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:16,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715385436] [2019-11-19 22:22:16,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:16,640 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:16,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:22:16,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:22:16,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:22:16,708 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 9 states. [2019-11-19 22:22:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:22:16,784 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-11-19 22:22:16,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:22:16,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2019-11-19 22:22:16,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:16,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2019-11-19 22:22:16,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 22:22:16,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 22:22:16,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2019-11-19 22:22:16,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:22:16,789 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-19 22:22:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2019-11-19 22:22:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-19 22:22:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-19 22:22:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-19 22:22:16,793 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-19 22:22:16,793 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-19 22:22:16,793 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 22:22:16,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-11-19 22:22:16,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:16,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:22:16,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:22:16,798 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2019-11-19 22:22:16,798 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 22:22:16,798 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 419#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 420#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 424#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 425#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 426#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 435#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 434#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 433#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 432#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 431#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 430#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 429#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 428#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 427#L19-3 assume !(main_~i~0 < 11); 421#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 422#L26-2 [2019-11-19 22:22:16,798 INFO L796 eck$LassoCheckResult]: Loop: 422#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 422#L26-2 [2019-11-19 22:22:16,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:16,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2019-11-19 22:22:16,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:16,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003501211] [2019-11-19 22:22:16,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:16,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003501211] [2019-11-19 22:22:16,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870667197] [2019-11-19 22:22:16,910 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:22:16,973 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-19 22:22:16,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:22:16,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:22:16,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:22:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:17,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:22:17,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-19 22:22:17,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268068751] [2019-11-19 22:22:17,010 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:22:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:17,011 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 7 times [2019-11-19 22:22:17,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:17,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278552885] [2019-11-19 22:22:17,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:17,032 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:17,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:22:17,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:22:17,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:22:17,114 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 10 states. [2019-11-19 22:22:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:22:17,176 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-19 22:22:17,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:22:17,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-11-19 22:22:17,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:17,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2019-11-19 22:22:17,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 22:22:17,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 22:22:17,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2019-11-19 22:22:17,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:22:17,179 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-19 22:22:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2019-11-19 22:22:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-19 22:22:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-19 22:22:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-11-19 22:22:17,183 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-19 22:22:17,183 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-19 22:22:17,183 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-19 22:22:17,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2019-11-19 22:22:17,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:17,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:22:17,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:22:17,186 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2019-11-19 22:22:17,186 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 22:22:17,187 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 515#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 516#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 520#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 521#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 522#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 533#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 532#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 531#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 530#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 529#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 528#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 527#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 526#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 525#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 524#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 523#L19-3 assume !(main_~i~0 < 11); 517#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 518#L26-2 [2019-11-19 22:22:17,187 INFO L796 eck$LassoCheckResult]: Loop: 518#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 518#L26-2 [2019-11-19 22:22:17,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:17,187 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2019-11-19 22:22:17,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:17,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882055292] [2019-11-19 22:22:17,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:17,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882055292] [2019-11-19 22:22:17,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104331753] [2019-11-19 22:22:17,294 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:22:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:17,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:22:17,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:22:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:17,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:22:17,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-19 22:22:17,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054616651] [2019-11-19 22:22:17,349 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:22:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:17,349 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 8 times [2019-11-19 22:22:17,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:17,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159056818] [2019-11-19 22:22:17,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:17,359 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:17,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:22:17,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:22:17,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:22:17,414 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 11 states. [2019-11-19 22:22:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:22:17,450 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-11-19 22:22:17,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:22:17,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2019-11-19 22:22:17,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:17,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2019-11-19 22:22:17,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 22:22:17,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 22:22:17,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2019-11-19 22:22:17,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:22:17,453 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-19 22:22:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2019-11-19 22:22:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-11-19 22:22:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-19 22:22:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-11-19 22:22:17,457 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-19 22:22:17,457 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-19 22:22:17,458 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-19 22:22:17,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-11-19 22:22:17,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:17,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:22:17,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:22:17,459 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2019-11-19 22:22:17,459 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 22:22:17,459 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 624#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 625#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 626#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 627#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 628#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 630#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 642#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 641#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 640#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 639#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 638#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 637#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 636#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 635#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 634#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 633#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 632#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 631#L19-3 assume !(main_~i~0 < 11); 622#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 623#L26-2 [2019-11-19 22:22:17,459 INFO L796 eck$LassoCheckResult]: Loop: 623#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 623#L26-2 [2019-11-19 22:22:17,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:17,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2019-11-19 22:22:17,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:17,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002155786] [2019-11-19 22:22:17,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:17,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002155786] [2019-11-19 22:22:17,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331301371] [2019-11-19 22:22:17,540 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:22:17,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:22:17,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:22:17,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:22:17,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:22:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:17,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:22:17,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-19 22:22:17,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497255935] [2019-11-19 22:22:17,607 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:22:17,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:17,608 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 9 times [2019-11-19 22:22:17,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:17,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067191269] [2019-11-19 22:22:17,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:17,622 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:17,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:22:17,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:22:17,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:22:17,676 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 12 states. [2019-11-19 22:22:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:22:17,748 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-11-19 22:22:17,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:22:17,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2019-11-19 22:22:17,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:17,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2019-11-19 22:22:17,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-19 22:22:17,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-19 22:22:17,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2019-11-19 22:22:17,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:22:17,752 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-19 22:22:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2019-11-19 22:22:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-11-19 22:22:17,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-19 22:22:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-19 22:22:17,755 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-19 22:22:17,755 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-19 22:22:17,756 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-19 22:22:17,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2019-11-19 22:22:17,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:17,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:22:17,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:22:17,758 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2019-11-19 22:22:17,758 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 22:22:17,759 INFO L794 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 740#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 741#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 745#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 746#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 747#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 762#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 761#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 760#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 759#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 758#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 757#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 756#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 755#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 754#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 753#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 752#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 751#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 750#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 749#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 748#L19-3 assume !(main_~i~0 < 11); 742#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 743#L26-2 [2019-11-19 22:22:17,759 INFO L796 eck$LassoCheckResult]: Loop: 743#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 743#L26-2 [2019-11-19 22:22:17,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:17,759 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2019-11-19 22:22:17,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:17,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208557700] [2019-11-19 22:22:17,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:17,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208557700] [2019-11-19 22:22:17,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956642281] [2019-11-19 22:22:17,872 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:22:17,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-19 22:22:17,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:22:17,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:22:17,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:22:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:17,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:22:17,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-19 22:22:17,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997202668] [2019-11-19 22:22:17,993 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:22:17,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:17,994 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 10 times [2019-11-19 22:22:17,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:17,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682519172] [2019-11-19 22:22:17,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:18,002 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:18,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:22:18,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:22:18,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:22:18,063 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 13 states. [2019-11-19 22:22:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:22:18,130 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-19 22:22:18,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:22:18,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-11-19 22:22:18,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:18,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2019-11-19 22:22:18,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-19 22:22:18,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-19 22:22:18,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2019-11-19 22:22:18,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:22:18,135 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-11-19 22:22:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2019-11-19 22:22:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-11-19 22:22:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 22:22:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-19 22:22:18,138 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-19 22:22:18,138 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-19 22:22:18,138 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-19 22:22:18,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2019-11-19 22:22:18,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:18,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:22:18,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:22:18,140 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2019-11-19 22:22:18,140 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 22:22:18,140 INFO L794 eck$LassoCheckResult]: Stem: 874#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 870#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 871#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 875#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 876#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 877#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 894#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 893#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 892#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 891#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 890#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 889#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 888#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 887#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 886#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 885#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 884#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 883#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 882#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 881#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 880#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 879#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 878#L19-3 assume !(main_~i~0 < 11); 872#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 873#L26-2 [2019-11-19 22:22:18,140 INFO L796 eck$LassoCheckResult]: Loop: 873#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 873#L26-2 [2019-11-19 22:22:18,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:18,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2019-11-19 22:22:18,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:18,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921315974] [2019-11-19 22:22:18,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:18,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921315974] [2019-11-19 22:22:18,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063066449] [2019-11-19 22:22:18,247 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:22:18,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 22:22:18,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:22:18,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:22:18,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:22:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:22:18,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:22:18,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-11-19 22:22:18,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093551803] [2019-11-19 22:22:18,307 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:22:18,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:18,308 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 11 times [2019-11-19 22:22:18,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:18,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902459417] [2019-11-19 22:22:18,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:18,316 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:18,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:22:18,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 22:22:18,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:22:18,371 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 14 states. [2019-11-19 22:22:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:22:18,435 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-11-19 22:22:18,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 22:22:18,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2019-11-19 22:22:18,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:18,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2019-11-19 22:22:18,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-19 22:22:18,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-19 22:22:18,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2019-11-19 22:22:18,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:22:18,438 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-19 22:22:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2019-11-19 22:22:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-11-19 22:22:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-19 22:22:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-19 22:22:18,440 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-19 22:22:18,440 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-19 22:22:18,440 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-19 22:22:18,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2019-11-19 22:22:18,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-19 22:22:18,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:22:18,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:22:18,442 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1] [2019-11-19 22:22:18,442 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-19 22:22:18,442 INFO L794 eck$LassoCheckResult]: Stem: 1014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1010#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 1011#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1015#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1016#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1017#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1036#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1035#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1034#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1033#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1032#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1031#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1030#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1029#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1028#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1027#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1026#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1025#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1024#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1023#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1022#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1021#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1020#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1019#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1018#L19-3 assume !(main_~i~0 < 11); 1012#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1013#L26-2 [2019-11-19 22:22:18,442 INFO L796 eck$LassoCheckResult]: Loop: 1013#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1013#L26-2 [2019-11-19 22:22:18,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:18,442 INFO L82 PathProgramCache]: Analyzing trace with hash -95647583, now seen corresponding path program 11 times [2019-11-19 22:22:18,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:18,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104896370] [2019-11-19 22:22:18,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:18,487 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:18,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:18,488 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 12 times [2019-11-19 22:22:18,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:18,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968164664] [2019-11-19 22:22:18,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:18,497 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:18,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:18,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1329892248, now seen corresponding path program 1 times [2019-11-19 22:22:18,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:22:18,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604039730] [2019-11-19 22:22:18,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:22:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:22:18,545 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:22:27,677 WARN L191 SmtUtils]: Spent 9.05 s on a formula simplification. DAG size of input: 217 DAG size of output: 163 [2019-11-19 22:22:27,973 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-19 22:22:27,976 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:22:27,977 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:22:27,977 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:22:27,977 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:22:27,977 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:22:27,977 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:22:27,977 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:22:27,977 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:22:27,977 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration13_Lasso [2019-11-19 22:22:27,978 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:22:27,978 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:22:27,981 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-19 22:22:27,984 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-19 22:22:27,985 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-19 22:22:27,989 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-19 22:22:27,991 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-19 22:22:27,997 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-19 22:22:28,087 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-19 22:22:28,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:22:28,092 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-19 22:22:28,305 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-19 22:22:28,602 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-11-19 22:22:28,620 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:22:28,621 INFO L489 LassoAnalysis]: Using template 'affine'. 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-19 22:22:28,652 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-19 22:22:28,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:22:28,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:22:28,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:22:28,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:22:28,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:22:28,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:22:28,656 INFO L402 nArgumentSynthesizer]: A total of 0 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-19 22:22:28,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:22:28,673 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-19 22:22:28,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:22:28,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:22:28,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:22:28,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:22:28,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:22:28,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:22:28,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:22:28,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:22:28,690 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-19 22:22:28,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:22:28,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:22:28,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:22:28,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:22:28,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:22:28,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:22:28,698 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-19 22:22:28,708 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-19 22:22:28,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:22:28,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:22:28,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:22:28,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:22:28,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:22:28,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:22:28,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:22:28,713 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-19 22:22:28,726 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-19 22:22:28,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:22:28,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:22:28,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:22:28,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:22:28,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:22:28,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:22:28,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:22:28,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:22:28,747 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-19 22:22:28,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:22:28,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:22:28,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:22:28,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:22:28,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:22:28,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:22:28,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:22:28,770 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-19 22:22:28,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:22:28,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:22:28,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:22:28,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:22:28,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:22:28,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:22:28,780 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:22:28,796 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-19 22:22:28,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:22:28,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:22:28,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:22:28,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:22:28,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:22:28,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:22:28,813 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:22:28,832 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-19 22:22:28,832 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:22:28,838 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:22:28,840 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:22:28,840 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:22:28,840 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#in~0.offset, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2, ULTIMATE.start_main_~idx_in~0) = -1*ULTIMATE.start_main_~#in~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2 - 1*ULTIMATE.start_main_~idx_in~0 Supporting invariants [] [2019-11-19 22:22:28,848 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-19 22:22:28,849 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 22:22:28,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:22:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:28,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:22:28,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:22:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:22:28,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:22:28,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:22:28,894 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-19 22:22:28,895 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-19 22:22:28,895 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 2 states. [2019-11-19 22:22:28,903 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3. Second operand 2 states. Result 28 states and 29 transitions. Complement of second has 2 states. [2019-11-19 22:22:28,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-19 22:22:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-19 22:22:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2019-11-19 22:22:28,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 1 letters. [2019-11-19 22:22:28,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:22:28,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 27 letters. Loop has 1 letters. [2019-11-19 22:22:28,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:22:28,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2019-11-19 22:22:28,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:22:28,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-11-19 22:22:28,907 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:22:28,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2019-11-19 22:22:28,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-19 22:22:28,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-19 22:22:28,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-19 22:22:28,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:22:28,908 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:22:28,908 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:22:28,908 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:22:28,908 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-19 22:22:28,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:22:28,908 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:22:28,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-19 22:22:28,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 10:22:28 BoogieIcfgContainer [2019-11-19 22:22:28,914 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 22:22:28,914 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:22:28,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:22:28,915 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:22:28,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:22:13" (3/4) ... [2019-11-19 22:22:28,918 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 22:22:28,918 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:22:28,920 INFO L168 Benchmark]: Toolchain (without parser) took 15937.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 276.3 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -201.3 MB). Peak memory consumption was 75.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:22:28,920 INFO L168 Benchmark]: CDTParser took 0.24 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-19 22:22:28,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.62 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 944.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:22:28,921 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 944.3 MB in the beginning and 1.2 GB in the end (delta: -206.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:22:28,922 INFO L168 Benchmark]: Boogie Preprocessor took 23.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:22:28,923 INFO L168 Benchmark]: RCFGBuilder took 320.94 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:22:28,923 INFO L168 Benchmark]: BuchiAutomizer took 15166.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -32.9 MB). Peak memory consumption was 89.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:22:28,923 INFO L168 Benchmark]: Witness Printer took 3.95 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:22:28,927 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.24 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 325.62 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 944.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 944.3 MB in the beginning and 1.2 GB in the end (delta: -206.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 320.94 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15166.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -32.9 MB). Peak memory consumption was 89.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 21 * unknown-#length-unknown[in] and consists of 5 locations. One deterministic module has affine ranking function -1 * in + unknown-#length-unknown[in] + -1 * idx_in and consists of 2 locations. 11 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.1s and 14 iterations. TraceHistogramMax:11. Analysis of lassos took 14.0s. Construction of modules took 0.4s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 23 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 12. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 52 SDtfs, 73 SDslu, 57 SDs, 0 SdLazy, 299 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital152 mio100 ax100 hnf100 lsp94 ukn55 mio100 lsp58 div155 bol100 ite103 ukn100 eq156 hnf73 smp97 dnf130 smp98 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...