./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sum05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/sum05-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eba670f8bd1fa8791e65a0e1ec2f8a5c20095daa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 08:17:09,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:17:09,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:17:09,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:17:09,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:17:09,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:17:09,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:17:09,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:17:09,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:17:09,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:17:09,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:17:09,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:17:09,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:17:09,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:17:09,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:17:09,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:17:09,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:17:09,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:17:09,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:17:09,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:17:09,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:17:09,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:17:09,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:17:09,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:17:09,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:17:09,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:17:09,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:17:09,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:17:09,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:17:09,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:17:09,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:17:09,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:17:09,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:17:09,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:17:09,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:17:09,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:17:09,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:17:09,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:17:09,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:17:09,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:17:09,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:17:09,946 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:17:09,992 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:17:09,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:17:09,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:17:09,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:17:09,996 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:17:09,996 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:17:09,996 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:17:09,997 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:17:09,997 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:17:09,997 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:17:09,998 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:17:09,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:17:09,999 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:17:10,000 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:17:10,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:17:10,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:17:10,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:17:10,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:17:10,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:17:10,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:17:10,001 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:17:10,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:17:10,002 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:17:10,002 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:17:10,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:17:10,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:17:10,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:17:10,003 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:17:10,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:17:10,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:17:10,004 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:17:10,004 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:17:10,005 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:17:10,005 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 -> eba670f8bd1fa8791e65a0e1ec2f8a5c20095daa [2020-10-20 08:17:10,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:17:10,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:17:10,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:17:10,226 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:17:10,227 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:17:10,228 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum05-2.i [2020-10-20 08:17:10,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c06edcad9/9e0436f9c7d542a2a4519255840744c0/FLAG155f6cd18 [2020-10-20 08:17:10,806 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:17:10,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i [2020-10-20 08:17:10,816 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c06edcad9/9e0436f9c7d542a2a4519255840744c0/FLAG155f6cd18 [2020-10-20 08:17:11,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c06edcad9/9e0436f9c7d542a2a4519255840744c0 [2020-10-20 08:17:11,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:17:11,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:17:11,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:17:11,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:17:11,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:17:11,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:17:11" (1/1) ... [2020-10-20 08:17:11,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e38263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:11, skipping insertion in model container [2020-10-20 08:17:11,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:17:11" (1/1) ... [2020-10-20 08:17:11,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:17:11,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:17:11,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:17:11,434 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:17:11,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:17:11,473 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:17:11,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:11 WrapperNode [2020-10-20 08:17:11,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:17:11,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:17:11,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:17:11,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:17:11,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:11" (1/1) ... [2020-10-20 08:17:11,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:11" (1/1) ... [2020-10-20 08:17:11,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:17:11,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:17:11,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:17:11,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:17:11,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:11" (1/1) ... [2020-10-20 08:17:11,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:11" (1/1) ... [2020-10-20 08:17:11,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:11" (1/1) ... [2020-10-20 08:17:11,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:11" (1/1) ... [2020-10-20 08:17:11,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:11" (1/1) ... [2020-10-20 08:17:11,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:11" (1/1) ... [2020-10-20 08:17:11,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:11" (1/1) ... [2020-10-20 08:17:11,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:17:11,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:17:11,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:17:11,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:17:11,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:11" (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 [2020-10-20 08:17:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:17:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:17:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 08:17:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:17:11,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:17:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 08:17:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:17:11,948 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:17:11,948 INFO L298 CfgBuilder]: Removed 17 assume(true) statements. [2020-10-20 08:17:11,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:17:11 BoogieIcfgContainer [2020-10-20 08:17:11,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:17:11,951 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:17:11,952 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:17:11,957 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:17:11,958 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:17:11,958 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:17:11" (1/3) ... [2020-10-20 08:17:11,960 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37703f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:17:11, skipping insertion in model container [2020-10-20 08:17:11,961 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:17:11,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:11" (2/3) ... [2020-10-20 08:17:11,962 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37703f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:17:11, skipping insertion in model container [2020-10-20 08:17:11,962 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:17:11,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:17:11" (3/3) ... [2020-10-20 08:17:11,964 INFO L373 chiAutomizerObserver]: Analyzing ICFG sum05-2.i [2020-10-20 08:17:12,032 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:17:12,033 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:17:12,033 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:17:12,033 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:17:12,047 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:17:12,048 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:17:12,048 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:17:12,048 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:17:12,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-10-20 08:17:12,116 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2020-10-20 08:17:12,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:12,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:12,124 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:17:12,125 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:12,125 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:17:12,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-10-20 08:17:12,128 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2020-10-20 08:17:12,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:12,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:12,128 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 08:17:12,129 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:12,137 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 9#L34-3true [2020-10-20 08:17:12,137 INFO L796 eck$LassoCheckResult]: Loop: 9#L34-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 11#L34-2true main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 9#L34-3true [2020-10-20 08:17:12,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:12,144 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 08:17:12,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:12,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111711392] [2020-10-20 08:17:12,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:12,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:12,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:12,308 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:12,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:12,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-20 08:17:12,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:12,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547482729] [2020-10-20 08:17:12,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:12,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:12,325 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:12,328 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:12,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:12,330 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-20 08:17:12,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:12,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303314325] [2020-10-20 08:17:12,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:12,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:12,377 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:12,383 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:12,659 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2020-10-20 08:17:12,755 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:12,756 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:12,756 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:12,756 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:12,756 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:12,756 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:12,756 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:12,757 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:12,757 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration1_Lasso [2020-10-20 08:17:12,757 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:12,757 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:12,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:12,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:12,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:12,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:12,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:12,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:12,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:12,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:12,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:12,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,357 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:13,363 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) [2020-10-20 08:17:13,378 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 [2020-10-20 08:17:13,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:13,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:13,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:13,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:13,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:13,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:13,399 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 [2020-10-20 08:17:13,403 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) [2020-10-20 08:17:13,451 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 [2020-10-20 08:17:13,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:13,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:13,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:13,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:13,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:13,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:13,456 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 [2020-10-20 08:17:13,458 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) [2020-10-20 08:17:13,511 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 [2020-10-20 08:17:13,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:13,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:13,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:13,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:13,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:13,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:13,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:13,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:13,566 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 [2020-10-20 08:17:13,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:13,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:13,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:13,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:13,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:13,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:13,577 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) [2020-10-20 08:17:13,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:13,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:13,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:13,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:13,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:13,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:13,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:13,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:13,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:13,667 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 [2020-10-20 08:17:13,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:13,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:13,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:13,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:13,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:13,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:13,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:13,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:13,714 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 [2020-10-20 08:17:13,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:13,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:13,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:13,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:13,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:13,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:13,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:13,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:13,745 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 [2020-10-20 08:17:13,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:13,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:13,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:13,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:13,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:13,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:13,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:13,801 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 [2020-10-20 08:17:13,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:13,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:13,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:13,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:13,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:13,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:13,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:13,865 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 [2020-10-20 08:17:13,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:13,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:13,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:13,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:13,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:13,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:13,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:13,916 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 [2020-10-20 08:17:13,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:13,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:13,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:13,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:13,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:13,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:13,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:13,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:13,949 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 [2020-10-20 08:17:13,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:13,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:13,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:13,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:13,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:13,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:13,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:13,986 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:13,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:13,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:13,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:13,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:13,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:13,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:13,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:14,027 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 [2020-10-20 08:17:14,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:14,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:14,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:14,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:14,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:14,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:14,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:14,080 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 [2020-10-20 08:17:14,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:14,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:14,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:14,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:14,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:14,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:14,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:14,117 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 [2020-10-20 08:17:14,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:14,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:14,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:14,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:14,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:14,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:14,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:14,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:14,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:14,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:14,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:14,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:14,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:14,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:14,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:14,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:14,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:14,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:14,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:14,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:14,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:14,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:14,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:14,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:14,300 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 [2020-10-20 08:17:14,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:14,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:14,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:14,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:14,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:14,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:14,319 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:17:14,485 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-20 08:17:14,485 INFO L444 ModelExtractionUtils]: 3 out of 16 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:14,495 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:17:14,498 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:17:14,499 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:17:14,500 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2020-10-20 08:17:14,555 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-10-20 08:17:14,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:17:14,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:14,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:17:14,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:14,621 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 08:17:14,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:14,675 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 [2020-10-20 08:17:14,676 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 3 states. [2020-10-20 08:17:14,793 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 3 states. Result 69 states and 97 transitions. Complement of second has 8 states. [2020-10-20 08:17:14,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:17:14,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:17:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2020-10-20 08:17:14,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-20 08:17:14,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:14,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-20 08:17:14,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:14,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-20 08:17:14,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:14,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 97 transitions. [2020-10-20 08:17:14,808 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-20 08:17:14,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 19 states and 24 transitions. [2020-10-20 08:17:14,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 08:17:14,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:17:14,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2020-10-20 08:17:14,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:14,818 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-20 08:17:14,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2020-10-20 08:17:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-10-20 08:17:14,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-20 08:17:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-10-20 08:17:14,847 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-20 08:17:14,847 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-20 08:17:14,847 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:17:14,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-10-20 08:17:14,849 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-20 08:17:14,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:14,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:14,849 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 08:17:14,850 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:14,850 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 176#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 173#L34-3 assume !(main_~i~1 < 5); 172#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 165#L20-3 [2020-10-20 08:17:14,850 INFO L796 eck$LassoCheckResult]: Loop: 165#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 166#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 165#L20-3 [2020-10-20 08:17:14,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:14,851 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-10-20 08:17:14,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:14,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909707133] [2020-10-20 08:17:14,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:14,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909707133] [2020-10-20 08:17:14,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:17:14,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:17:14,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675370436] [2020-10-20 08:17:14,904 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:14,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:14,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2020-10-20 08:17:14,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:14,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751806561] [2020-10-20 08:17:14,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:14,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:14,914 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:14,916 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:14,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:14,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:17:14,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:17:14,959 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-20 08:17:14,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:14,972 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-10-20 08:17:14,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:17:14,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2020-10-20 08:17:14,975 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-20 08:17:14,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2020-10-20 08:17:14,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 08:17:14,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:17:14,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2020-10-20 08:17:14,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:14,976 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-10-20 08:17:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2020-10-20 08:17:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-10-20 08:17:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-20 08:17:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2020-10-20 08:17:14,979 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-10-20 08:17:14,979 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-10-20 08:17:14,979 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:17:14,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2020-10-20 08:17:14,980 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-20 08:17:14,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:14,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:14,980 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:17:14,980 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:14,981 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 221#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 218#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 219#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 220#L34-3 assume !(main_~i~1 < 5); 217#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 210#L20-3 [2020-10-20 08:17:14,981 INFO L796 eck$LassoCheckResult]: Loop: 210#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 211#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 210#L20-3 [2020-10-20 08:17:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:14,981 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-10-20 08:17:14,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:14,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419510955] [2020-10-20 08:17:14,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:15,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419510955] [2020-10-20 08:17:15,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312361249] [2020-10-20 08:17:15,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:15,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 08:17:15,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:15,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:15,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-20 08:17:15,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744533251] [2020-10-20 08:17:15,090 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:15,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:15,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2020-10-20 08:17:15,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:15,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344740990] [2020-10-20 08:17:15,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,098 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,105 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:15,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:15,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:17:15,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:17:15,137 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-10-20 08:17:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:15,160 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-10-20 08:17:15,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:17:15,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2020-10-20 08:17:15,162 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-20 08:17:15,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2020-10-20 08:17:15,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 08:17:15,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:17:15,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2020-10-20 08:17:15,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:15,164 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-10-20 08:17:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2020-10-20 08:17:15,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-10-20 08:17:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-20 08:17:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-10-20 08:17:15,167 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-10-20 08:17:15,167 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-10-20 08:17:15,167 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:17:15,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2020-10-20 08:17:15,168 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-20 08:17:15,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:15,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:15,169 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-20 08:17:15,170 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:15,170 INFO L794 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 286#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 282#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 283#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 284#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 285#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 292#L34-3 assume !(main_~i~1 < 5); 281#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 274#L20-3 [2020-10-20 08:17:15,170 INFO L796 eck$LassoCheckResult]: Loop: 274#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 275#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 274#L20-3 [2020-10-20 08:17:15,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:15,171 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-10-20 08:17:15,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:15,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573234799] [2020-10-20 08:17:15,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:15,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573234799] [2020-10-20 08:17:15,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155886782] [2020-10-20 08:17:15,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:15,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:17:15,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:17:15,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:15,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:15,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:15,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 08:17:15,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157404330] [2020-10-20 08:17:15,345 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:15,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:15,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2020-10-20 08:17:15,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:15,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518892714] [2020-10-20 08:17:15,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,365 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,370 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:15,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:15,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 08:17:15,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 08:17:15,409 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-10-20 08:17:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:15,461 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-10-20 08:17:15,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:17:15,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2020-10-20 08:17:15,463 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-20 08:17:15,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2020-10-20 08:17:15,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 08:17:15,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:17:15,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-10-20 08:17:15,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:15,465 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-10-20 08:17:15,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-10-20 08:17:15,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-10-20 08:17:15,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-20 08:17:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-10-20 08:17:15,467 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-10-20 08:17:15,467 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-10-20 08:17:15,468 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:17:15,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2020-10-20 08:17:15,468 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-20 08:17:15,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:15,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:15,469 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-10-20 08:17:15,469 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:15,469 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 357#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 358#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 359#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 360#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 361#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 369#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 368#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 367#L34-3 assume !(main_~i~1 < 5); 356#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 349#L20-3 [2020-10-20 08:17:15,470 INFO L796 eck$LassoCheckResult]: Loop: 349#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 350#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 349#L20-3 [2020-10-20 08:17:15,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:15,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-10-20 08:17:15,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:15,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194562796] [2020-10-20 08:17:15,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:15,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194562796] [2020-10-20 08:17:15,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671123367] [2020-10-20 08:17:15,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:15,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 08:17:15,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:17:15,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 08:17:15,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:15,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:15,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 08:17:15,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800010020] [2020-10-20 08:17:15,628 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:15,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:15,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2020-10-20 08:17:15,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:15,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186940643] [2020-10-20 08:17:15,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,634 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,640 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:15,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:15,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 08:17:15,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 08:17:15,668 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-10-20 08:17:15,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:15,692 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-10-20 08:17:15,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 08:17:15,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2020-10-20 08:17:15,694 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-20 08:17:15,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2020-10-20 08:17:15,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 08:17:15,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:17:15,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2020-10-20 08:17:15,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:15,696 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2020-10-20 08:17:15,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2020-10-20 08:17:15,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-10-20 08:17:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-20 08:17:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-10-20 08:17:15,699 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-10-20 08:17:15,699 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-10-20 08:17:15,699 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:17:15,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2020-10-20 08:17:15,700 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-20 08:17:15,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:15,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:15,701 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-10-20 08:17:15,701 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:15,701 INFO L794 eck$LassoCheckResult]: Stem: 448#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 443#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 444#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 445#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 446#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 447#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 449#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 457#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 456#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 455#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 454#L34-3 assume !(main_~i~1 < 5); 442#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 435#L20-3 [2020-10-20 08:17:15,702 INFO L796 eck$LassoCheckResult]: Loop: 435#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 436#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 435#L20-3 [2020-10-20 08:17:15,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:15,702 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-10-20 08:17:15,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:15,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848435083] [2020-10-20 08:17:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:15,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848435083] [2020-10-20 08:17:15,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131999062] [2020-10-20 08:17:15,766 INFO L93 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:15,808 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 08:17:15,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:17:15,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 08:17:15,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:15,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:15,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-20 08:17:15,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408760663] [2020-10-20 08:17:15,834 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:15,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:15,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2020-10-20 08:17:15,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:15,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548093295] [2020-10-20 08:17:15,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,839 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,843 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,844 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:15,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:15,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 08:17:15,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 08:17:15,880 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-10-20 08:17:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:15,905 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-10-20 08:17:15,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:17:15,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2020-10-20 08:17:15,907 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-20 08:17:15,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2020-10-20 08:17:15,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 08:17:15,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:17:15,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2020-10-20 08:17:15,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:15,908 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-10-20 08:17:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2020-10-20 08:17:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-20 08:17:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 08:17:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-10-20 08:17:15,912 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-10-20 08:17:15,912 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-10-20 08:17:15,912 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:17:15,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2020-10-20 08:17:15,913 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-10-20 08:17:15,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:15,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:15,914 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-10-20 08:17:15,914 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:15,914 INFO L794 eck$LassoCheckResult]: Stem: 545#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 543#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 539#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 540#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 541#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 542#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 544#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 555#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 554#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 553#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 552#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 551#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 550#L34-3 assume !(main_~i~1 < 5); 538#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 531#L20-3 [2020-10-20 08:17:15,915 INFO L796 eck$LassoCheckResult]: Loop: 531#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 532#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 531#L20-3 [2020-10-20 08:17:15,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:15,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-10-20 08:17:15,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:15,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27902434] [2020-10-20 08:17:15,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,953 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:15,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:15,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2020-10-20 08:17:15,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:15,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889795500] [2020-10-20 08:17:15,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,958 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,961 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,963 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:15,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:15,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2020-10-20 08:17:15,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:15,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967692450] [2020-10-20 08:17:15,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:16,004 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:16,013 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:17,218 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 167 DAG size of output: 127 [2020-10-20 08:17:17,440 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-20 08:17:17,445 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:17,446 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:17,446 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:17,446 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:17,446 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:17,446 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:17,446 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:17,446 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:17,446 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration7_Lasso [2020-10-20 08:17:17,446 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:17,447 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:17,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,676 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-10-20 08:17:17,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:17,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:18,118 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:18,118 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:18,123 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 [2020-10-20 08:17:18,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:18,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:18,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:18,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:18,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:18,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:18,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:18,127 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 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 [2020-10-20 08:17:18,148 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 [2020-10-20 08:17:18,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:18,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:18,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:18,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:18,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:18,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:18,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:18,152 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:18,173 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 [2020-10-20 08:17:18,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:18,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:18,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:18,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:18,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:18,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:18,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:18,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:18,201 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 [2020-10-20 08:17:18,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:18,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:18,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:18,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:18,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:18,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:18,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:18,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:18,228 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 [2020-10-20 08:17:18,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:18,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:18,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:18,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:18,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:18,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:18,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:18,268 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 [2020-10-20 08:17:18,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:18,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:18,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:18,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:18,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:18,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:18,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:18,307 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 [2020-10-20 08:17:18,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:18,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:18,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:18,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:18,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:18,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:18,330 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:17:18,351 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-20 08:17:18,351 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:18,355 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:17:18,358 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:17:18,358 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:17:18,358 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, v_rep(select #length ULTIMATE.start_sum_~x.base)_1) = -8*ULTIMATE.start_sum_~i~0 + 9*v_rep(select #length ULTIMATE.start_sum_~x.base)_1 Supporting invariants [] [2020-10-20 08:17:18,417 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 08:17:18,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:17:18,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:18,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:17:18,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:18,476 WARN L261 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 08:17:18,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:18,494 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 [2020-10-20 08:17:18,494 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-20 08:17:18,521 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 7 states. [2020-10-20 08:17:18,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:17:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:17:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-10-20 08:17:18,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2020-10-20 08:17:18,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:18,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 16 letters. Loop has 2 letters. [2020-10-20 08:17:18,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:18,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 4 letters. [2020-10-20 08:17:18,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:18,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2020-10-20 08:17:18,526 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-20 08:17:18,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2020-10-20 08:17:18,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 08:17:18,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-20 08:17:18,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2020-10-20 08:17:18,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:18,527 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-10-20 08:17:18,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2020-10-20 08:17:18,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-10-20 08:17:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-20 08:17:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-10-20 08:17:18,530 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-10-20 08:17:18,530 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-10-20 08:17:18,530 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:17:18,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2020-10-20 08:17:18,531 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-20 08:17:18,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:18,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:18,531 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:18,531 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:18,532 INFO L794 eck$LassoCheckResult]: Stem: 719#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 714#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 715#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 716#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 717#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 718#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 720#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 730#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 729#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 728#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 727#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 726#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 725#L34-3 assume !(main_~i~1 < 5); 713#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 705#L20-3 assume !(sum_~i~0 < 5); 703#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 704#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 723#L20-8 [2020-10-20 08:17:18,532 INFO L796 eck$LassoCheckResult]: Loop: 723#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 724#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 723#L20-8 [2020-10-20 08:17:18,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:18,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581027, now seen corresponding path program 1 times [2020-10-20 08:17:18,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:18,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590193533] [2020-10-20 08:17:18,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 08:17:18,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590193533] [2020-10-20 08:17:18,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:17:18,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:17:18,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213287406] [2020-10-20 08:17:18,566 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:18,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2020-10-20 08:17:18,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:18,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397591593] [2020-10-20 08:17:18,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:18,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:18,573 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:18,575 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:18,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:18,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:17:18,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:17:18,605 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-10-20 08:17:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:18,632 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-10-20 08:17:18,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:17:18,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2020-10-20 08:17:18,633 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-20 08:17:18,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2020-10-20 08:17:18,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-20 08:17:18,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-20 08:17:18,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2020-10-20 08:17:18,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:18,635 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-10-20 08:17:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2020-10-20 08:17:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2020-10-20 08:17:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-20 08:17:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-10-20 08:17:18,638 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-10-20 08:17:18,638 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-10-20 08:17:18,638 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:17:18,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2020-10-20 08:17:18,639 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-20 08:17:18,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:18,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:18,640 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:18,640 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:18,641 INFO L794 eck$LassoCheckResult]: Stem: 786#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 781#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 782#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 783#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 784#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 785#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 798#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 797#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 796#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 795#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 794#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 793#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 792#L34-3 assume !(main_~i~1 < 5); 780#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 772#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 773#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 774#L20-3 assume !(sum_~i~0 < 5); 770#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 771#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 789#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 790#L20-7 [2020-10-20 08:17:18,641 INFO L796 eck$LassoCheckResult]: Loop: 790#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 791#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 790#L20-7 [2020-10-20 08:17:18,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:18,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1577614809, now seen corresponding path program 1 times [2020-10-20 08:17:18,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:18,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313078500] [2020-10-20 08:17:18,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 08:17:18,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313078500] [2020-10-20 08:17:18,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665743193] [2020-10-20 08:17:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:18,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 08:17:18,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 08:17:18,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:18,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-20 08:17:18,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393187063] [2020-10-20 08:17:18,739 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:18,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:18,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2020-10-20 08:17:18,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:18,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770639143] [2020-10-20 08:17:18,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:18,744 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:18,746 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:18,748 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:18,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:18,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:17:18,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:17:18,790 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-10-20 08:17:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:18,829 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-10-20 08:17:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:17:18,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2020-10-20 08:17:18,831 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-20 08:17:18,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 43 transitions. [2020-10-20 08:17:18,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-20 08:17:18,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-20 08:17:18,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2020-10-20 08:17:18,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:18,833 INFO L691 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-10-20 08:17:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2020-10-20 08:17:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2020-10-20 08:17:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-20 08:17:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-10-20 08:17:18,836 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-10-20 08:17:18,836 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-10-20 08:17:18,836 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:17:18,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2020-10-20 08:17:18,836 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-20 08:17:18,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:18,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:18,837 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:18,837 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:18,838 INFO L794 eck$LassoCheckResult]: Stem: 920#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 915#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 916#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 917#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 918#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 919#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 935#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 934#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 933#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 932#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 931#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 930#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 929#L34-3 assume !(main_~i~1 < 5); 914#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 905#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 906#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 907#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 908#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 927#L20-3 assume !(sum_~i~0 < 5); 903#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 904#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 925#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 926#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 923#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 924#L20-7 [2020-10-20 08:17:18,838 INFO L796 eck$LassoCheckResult]: Loop: 924#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 928#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 924#L20-7 [2020-10-20 08:17:18,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:18,838 INFO L82 PathProgramCache]: Analyzing trace with hash -483964569, now seen corresponding path program 1 times [2020-10-20 08:17:18,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:18,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731684230] [2020-10-20 08:17:18,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-20 08:17:18,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731684230] [2020-10-20 08:17:18,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105456910] [2020-10-20 08:17:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:18,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:18,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-20 08:17:18,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:18,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 08:17:18,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730796712] [2020-10-20 08:17:18,956 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:18,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:18,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2020-10-20 08:17:18,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:18,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328747328] [2020-10-20 08:17:18,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:18,960 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:18,963 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:18,964 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:18,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:18,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 08:17:18,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 08:17:18,994 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-10-20 08:17:19,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:19,052 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-10-20 08:17:19,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:17:19,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 49 transitions. [2020-10-20 08:17:19,055 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-20 08:17:19,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 49 transitions. [2020-10-20 08:17:19,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-20 08:17:19,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-20 08:17:19,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 49 transitions. [2020-10-20 08:17:19,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:19,057 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-10-20 08:17:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 49 transitions. [2020-10-20 08:17:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2020-10-20 08:17:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-20 08:17:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-10-20 08:17:19,065 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-10-20 08:17:19,066 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-10-20 08:17:19,066 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 08:17:19,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2020-10-20 08:17:19,067 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-20 08:17:19,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:19,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:19,068 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:19,068 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:19,069 INFO L794 eck$LassoCheckResult]: Stem: 1077#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1076#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1072#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1073#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1074#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1075#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1093#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1092#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1091#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1090#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1089#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1088#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1087#L34-3 assume !(main_~i~1 < 5); 1071#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1061#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1062#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1068#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1095#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1063#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1064#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1084#L20-3 assume !(sum_~i~0 < 5); 1059#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1060#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1082#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1083#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1080#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1081#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1094#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1086#L20-7 [2020-10-20 08:17:19,070 INFO L796 eck$LassoCheckResult]: Loop: 1086#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1085#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1086#L20-7 [2020-10-20 08:17:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:19,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1757450151, now seen corresponding path program 2 times [2020-10-20 08:17:19,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:19,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920914095] [2020-10-20 08:17:19,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-10-20 08:17:19,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920914095] [2020-10-20 08:17:19,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651818395] [2020-10-20 08:17:19,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:19,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:17:19,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:17:19,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 08:17:19,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-10-20 08:17:19,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:19,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 08:17:19,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601988064] [2020-10-20 08:17:19,248 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:19,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:19,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2020-10-20 08:17:19,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:19,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024422110] [2020-10-20 08:17:19,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:19,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:19,254 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:19,255 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:19,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:19,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 08:17:19,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 08:17:19,279 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-10-20 08:17:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:19,341 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2020-10-20 08:17:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 08:17:19,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2020-10-20 08:17:19,342 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-20 08:17:19,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 55 transitions. [2020-10-20 08:17:19,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-10-20 08:17:19,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-10-20 08:17:19,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 55 transitions. [2020-10-20 08:17:19,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:19,344 INFO L691 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-10-20 08:17:19,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 55 transitions. [2020-10-20 08:17:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2020-10-20 08:17:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-20 08:17:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-10-20 08:17:19,347 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-10-20 08:17:19,347 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-10-20 08:17:19,347 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 08:17:19,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2020-10-20 08:17:19,348 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-20 08:17:19,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:19,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:19,349 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:19,349 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:19,350 INFO L794 eck$LassoCheckResult]: Stem: 1255#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1250#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1251#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1252#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1253#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1254#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1272#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1271#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1270#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1269#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1268#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1267#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1266#L34-3 assume !(main_~i~1 < 5); 1249#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1240#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1241#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1242#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1243#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1275#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1274#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1273#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1263#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1262#L20-3 assume !(sum_~i~0 < 5); 1238#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1239#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1260#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1261#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1258#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1259#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1278#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1277#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1276#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1265#L20-7 [2020-10-20 08:17:19,350 INFO L796 eck$LassoCheckResult]: Loop: 1265#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1264#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1265#L20-7 [2020-10-20 08:17:19,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:19,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1218450663, now seen corresponding path program 3 times [2020-10-20 08:17:19,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:19,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606832775] [2020-10-20 08:17:19,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-10-20 08:17:19,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606832775] [2020-10-20 08:17:19,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631811996] [2020-10-20 08:17:19,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:19,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-20 08:17:19,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:17:19,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 08:17:19,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-10-20 08:17:19,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:19,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-20 08:17:19,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970108071] [2020-10-20 08:17:19,537 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:19,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:19,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2020-10-20 08:17:19,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:19,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098213119] [2020-10-20 08:17:19,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:19,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:19,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:19,544 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:19,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:19,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 08:17:19,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 08:17:19,569 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-10-20 08:17:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:19,656 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-10-20 08:17:19,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:17:19,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 58 transitions. [2020-10-20 08:17:19,657 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-20 08:17:19,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 58 transitions. [2020-10-20 08:17:19,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-10-20 08:17:19,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-10-20 08:17:19,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions. [2020-10-20 08:17:19,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:19,659 INFO L691 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-10-20 08:17:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions. [2020-10-20 08:17:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2020-10-20 08:17:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 08:17:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-10-20 08:17:19,663 INFO L714 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-10-20 08:17:19,663 INFO L594 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-10-20 08:17:19,663 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 08:17:19,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 49 transitions. [2020-10-20 08:17:19,664 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-10-20 08:17:19,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:19,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:19,665 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:19,666 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:19,666 INFO L794 eck$LassoCheckResult]: Stem: 1454#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1449#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1450#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1451#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1452#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1453#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1475#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1473#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1471#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1469#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1467#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1465#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1464#L34-3 assume !(main_~i~1 < 5); 1448#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1439#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1440#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1441#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1442#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1481#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1480#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1479#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1478#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1477#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1461#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1460#L20-3 assume !(sum_~i~0 < 5); 1437#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1438#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1457#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1458#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1459#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1476#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1474#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1472#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1470#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1468#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1466#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1463#L20-7 [2020-10-20 08:17:19,666 INFO L796 eck$LassoCheckResult]: Loop: 1463#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1462#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1463#L20-7 [2020-10-20 08:17:19,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2144167641, now seen corresponding path program 4 times [2020-10-20 08:17:19,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:19,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778398101] [2020-10-20 08:17:19,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:19,720 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:19,778 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:19,786 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:19,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:19,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2020-10-20 08:17:19,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:19,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636991798] [2020-10-20 08:17:19,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:19,790 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:19,792 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:19,793 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1039200421, now seen corresponding path program 5 times [2020-10-20 08:17:19,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:19,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180424569] [2020-10-20 08:17:19,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:19,866 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-10-20 08:17:19,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180424569] [2020-10-20 08:17:19,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646994775] [2020-10-20 08:17:19,867 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:19,958 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-20 08:17:19,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:17:19,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 08:17:19,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-10-20 08:17:19,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 08:17:19,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2020-10-20 08:17:19,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065294119] [2020-10-20 08:17:20,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:20,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 08:17:20,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-10-20 08:17:20,009 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-10-20 08:17:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:20,096 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-10-20 08:17:20,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 08:17:20,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2020-10-20 08:17:20,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:17:20,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 43 transitions. [2020-10-20 08:17:20,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-20 08:17:20,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-10-20 08:17:20,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 43 transitions. [2020-10-20 08:17:20,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:20,099 INFO L691 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-20 08:17:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 43 transitions. [2020-10-20 08:17:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-20 08:17:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-20 08:17:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-10-20 08:17:20,102 INFO L714 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-20 08:17:20,102 INFO L594 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-20 08:17:20,102 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 08:17:20,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 43 transitions. [2020-10-20 08:17:20,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 08:17:20,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:20,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:20,104 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:20,104 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:20,104 INFO L794 eck$LassoCheckResult]: Stem: 1674#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10); 1669#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~post5, main_~i~1, main_#t~ret7, main_#t~mem8, main_#t~mem9, main_#t~ret10, main_#t~mem11, main_#t~mem13, main_#t~post12, main_~i~2, main_#t~ret14, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1670#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1671#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1672#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1673#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1695#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1694#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1692#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1690#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1688#L34-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet6, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet6; 1685#L34-2 main_#t~post5 := main_~i~1;main_~i~1 := 1 + main_#t~post5;havoc main_#t~post5; 1684#L34-3 assume !(main_~i~1 < 5); 1668#L34-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1663#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1664#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1665#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1693#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1691#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1689#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1687#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1686#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1683#L20-3 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1682#L20-2 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1681#L20-3 assume !(sum_~i~0 < 5); 1661#L20-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1662#L23 main_#t~ret7 := sum_#res;main_~ret~1 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;call main_#t~mem9 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem9;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem4, sum_#t~post3, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1679#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1680#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1677#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1678#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1702#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1701#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1700#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1699#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1698#L20-8 assume !!(sum_~i~0 < 5);call sum_#t~mem4 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem4;havoc sum_#t~mem4; 1697#L20-7 sum_#t~post3 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post3;havoc sum_#t~post3; 1696#L20-8 assume !(sum_~i~0 < 5); 1675#L20-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1676#L23-1 main_#t~ret10 := sum_#res;main_~ret2~0 := main_#t~ret10;havoc main_#t~ret10;call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~2 := 0; 1666#L43-3 [2020-10-20 08:17:20,104 INFO L796 eck$LassoCheckResult]: Loop: 1666#L43-3 assume !!(main_~i~2 < 4);call main_#t~mem13 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem13, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem13; 1667#L43-2 main_#t~post12 := main_~i~2;main_~i~2 := 1 + main_#t~post12;havoc main_#t~post12; 1666#L43-3 [2020-10-20 08:17:20,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:20,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2055775835, now seen corresponding path program 1 times [2020-10-20 08:17:20,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:20,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677745341] [2020-10-20 08:17:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:20,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:20,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:20,276 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:20,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:20,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2020-10-20 08:17:20,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:20,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720216605] [2020-10-20 08:17:20,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:20,281 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:20,283 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:20,285 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:20,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:20,286 INFO L82 PathProgramCache]: Analyzing trace with hash 84380519, now seen corresponding path program 1 times [2020-10-20 08:17:20,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:20,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370648601] [2020-10-20 08:17:20,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:20,332 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:20,365 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:20,392 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:39,648 WARN L193 SmtUtils]: Spent 19.20 s on a formula simplification. DAG size of input: 383 DAG size of output: 278 [2020-10-20 08:17:39,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:17:39,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:17:39,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:17:48,064 WARN L193 SmtUtils]: Spent 8.19 s on a formula simplification. DAG size of input: 283 DAG size of output: 201 [2020-10-20 08:17:48,072 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:48,072 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:48,072 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:48,072 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:48,072 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:48,072 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:48,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:48,073 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:48,073 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum05-2.i_Iteration14_Lasso [2020-10-20 08:17:48,073 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:48,073 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:48,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:48,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:48,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:48,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:48,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,127 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2020-10-20 08:17:55,114 WARN L193 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 116 [2020-10-20 08:17:55,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:55,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:55,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:55,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:55,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:55,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:55,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:55,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:55,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:55,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:55,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:55,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:55,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:56,817 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 163 DAG size of output: 135 [2020-10-20 08:17:56,913 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2020-10-20 08:17:58,852 WARN L193 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 130 DAG size of output: 123 [2020-10-20 08:17:58,955 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:58,956 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:58,978 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 [2020-10-20 08:17:58,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:58,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:58,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:58,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:58,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:58,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:58,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:58,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,009 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 [2020-10-20 08:17:59,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:59,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:59,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:59,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:59,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:59,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:59,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:59,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,036 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 [2020-10-20 08:17:59,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:59,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:59,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:59,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:59,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:59,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:59,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:59,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,064 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 [2020-10-20 08:17:59,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:59,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:59,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:59,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:59,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:59,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:59,071 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:59,116 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 [2020-10-20 08:17:59,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:59,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:59,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:59,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:59,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:59,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,129 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:59,165 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 [2020-10-20 08:17:59,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:59,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:59,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:59,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:59,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:59,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:59,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,172 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 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,203 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 [2020-10-20 08:17:59,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:59,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:59,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:59,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:59,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:59,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:59,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:59,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,231 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 [2020-10-20 08:17:59,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:59,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:59,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:59,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:59,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:59,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:59,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,284 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 [2020-10-20 08:17:59,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:59,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:59,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:59,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:59,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:59,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:59,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:59,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,317 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 [2020-10-20 08:17:59,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:59,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:59,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:59,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:59,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:59,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:59,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:59,351 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 [2020-10-20 08:17:59,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:59,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:59,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:59,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:59,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:59,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,384 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 [2020-10-20 08:17:59,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:59,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:59,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:59,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:59,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:59,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:59,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:59,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:59,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:59,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:59,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:59,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:59,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:59,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:59,443 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:59,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:59,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:59,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:59,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:59,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:59,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:59,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:59,471 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:59,473 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-20 08:17:59,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:59,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:59,494 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-20 08:17:59,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:59,531 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:17:59,580 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-20 08:17:59,580 INFO L444 ModelExtractionUtils]: 34 out of 67 variables were initially zero. Simplification set additionally 30 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:59,582 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:59,584 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:17:59,585 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:17:59,585 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2020-10-20 08:17:59,987 INFO L297 tatePredicateManager]: 48 out of 48 supporting invariants were superfluous and have been removed [2020-10-20 08:18:00,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:18:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:00,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:18:00,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:18:00,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:18:00,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:18:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:18:00,081 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 [2020-10-20 08:18:00,081 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-10-20 08:18:00,097 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 44 states and 46 transitions. Complement of second has 4 states. [2020-10-20 08:18:00,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 08:18:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:18:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-10-20 08:18:00,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 2 letters. [2020-10-20 08:18:00,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:00,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 42 letters. Loop has 2 letters. [2020-10-20 08:18:00,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:00,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 4 letters. [2020-10-20 08:18:00,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:18:00,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2020-10-20 08:18:00,101 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:18:00,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2020-10-20 08:18:00,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 08:18:00,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 08:18:00,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 08:18:00,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:18:00,102 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:18:00,102 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:18:00,102 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:18:00,102 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-20 08:18:00,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 08:18:00,103 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:18:00,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 08:18:00,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:18:00 BoogieIcfgContainer [2020-10-20 08:18:00,110 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:18:00,110 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:18:00,110 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:18:00,111 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:18:00,111 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:17:11" (3/4) ... [2020-10-20 08:18:00,115 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 08:18:00,115 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:18:00,117 INFO L168 Benchmark]: Toolchain (without parser) took 48962.08 ms. Allocated memory was 36.2 MB in the beginning and 132.1 MB in the end (delta: 95.9 MB). Free memory was 16.1 MB in the beginning and 25.5 MB in the end (delta: -9.4 MB). Peak memory consumption was 86.5 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:00,117 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 34.1 MB. Free memory was 9.5 MB in the beginning and 9.5 MB in the end (delta: 43.9 kB). Peak memory consumption was 43.9 kB. Max. memory is 14.3 GB. [2020-10-20 08:18:00,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.78 ms. Allocated memory was 36.2 MB in the beginning and 44.6 MB in the end (delta: 8.4 MB). Free memory was 15.2 MB in the beginning and 25.3 MB in the end (delta: -10.1 MB). Peak memory consumption was 9.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:00,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.85 ms. Allocated memory is still 44.6 MB. Free memory was 25.3 MB in the beginning and 23.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:00,119 INFO L168 Benchmark]: Boogie Preprocessor took 41.40 ms. Allocated memory is still 44.6 MB. Free memory was 23.4 MB in the beginning and 21.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:00,119 INFO L168 Benchmark]: RCFGBuilder took 392.45 ms. Allocated memory was 44.6 MB in the beginning and 46.7 MB in the end (delta: 2.1 MB). Free memory was 21.7 MB in the beginning and 16.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 10.2 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:00,120 INFO L168 Benchmark]: BuchiAutomizer took 48158.77 ms. Allocated memory was 46.7 MB in the beginning and 132.1 MB in the end (delta: 85.5 MB). Free memory was 16.0 MB in the beginning and 25.5 MB in the end (delta: -9.5 MB). Peak memory consumption was 76.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:18:00,121 INFO L168 Benchmark]: Witness Printer took 4.95 ms. Allocated memory is still 132.1 MB. Free memory is still 25.5 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 08:18:00,123 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 34.1 MB. Free memory was 9.5 MB in the beginning and 9.5 MB in the end (delta: 43.9 kB). Peak memory consumption was 43.9 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 313.78 ms. Allocated memory was 36.2 MB in the beginning and 44.6 MB in the end (delta: 8.4 MB). Free memory was 15.2 MB in the beginning and 25.3 MB in the end (delta: -10.1 MB). Peak memory consumption was 9.9 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 40.85 ms. Allocated memory is still 44.6 MB. Free memory was 25.3 MB in the beginning and 23.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 41.40 ms. Allocated memory is still 44.6 MB. Free memory was 23.4 MB in the beginning and 21.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 392.45 ms. Allocated memory was 44.6 MB in the beginning and 46.7 MB in the end (delta: 2.1 MB). Free memory was 21.7 MB in the beginning and 16.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 10.2 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 48158.77 ms. Allocated memory was 46.7 MB in the beginning and 132.1 MB in the end (delta: 85.5 MB). Free memory was 16.0 MB in the beginning and 25.5 MB in the end (delta: -9.5 MB). Peak memory consumption was 76.0 MB. Max. memory is 14.3 GB. * Witness Printer took 4.95 ms. Allocated memory is still 132.1 MB. Free memory is still 25.5 MB. There was no memory consumed. Max. memory is 14.3 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 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 48.0s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 46.8s. Construction of modules took 0.4s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 41 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 233 SDtfs, 164 SDslu, 421 SDs, 0 SdLazy, 316 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital638 mio100 ax100 hnf99 lsp238 ukn40 mio100 lsp91 div97 bol100 ite100 ukn100 eq161 hnf88 smp85 dnf231 smp74 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 116ms VariablesStem: 41 VariablesLoop: 11 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...