./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1a7013a4cfa859e3e95189f90d363983a25fcd0e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:37:13,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:37:13,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:37:13,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:37:13,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:37:14,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:37:14,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:37:14,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:37:14,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:37:14,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:37:14,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:37:14,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:37:14,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:37:14,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:37:14,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:37:14,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:37:14,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:37:14,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:37:14,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:37:14,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:37:14,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:37:14,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:37:14,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:37:14,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:37:14,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:37:14,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:37:14,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:37:14,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:37:14,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:37:14,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:37:14,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:37:14,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:37:14,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:37:14,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:37:14,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:37:14,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:37:14,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:37:14,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:37:14,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:37:14,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:37:14,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:37:14,069 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:37:14,108 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:37:14,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:37:14,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:37:14,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:37:14,115 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:37:14,115 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:37:14,116 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:37:14,116 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:37:14,116 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:37:14,116 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:37:14,116 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:37:14,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:37:14,117 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:37:14,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:37:14,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:37:14,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:37:14,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:37:14,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:37:14,122 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:37:14,122 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:37:14,122 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:37:14,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:37:14,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:37:14,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:37:14,123 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:37:14,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:37:14,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:37:14,124 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:37:14,124 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:37:14,126 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:37:14,126 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a7013a4cfa859e3e95189f90d363983a25fcd0e [2020-07-29 01:37:14,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:37:14,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:37:14,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:37:14,517 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:37:14,518 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:37:14,519 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2020-07-29 01:37:14,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c513b68d1/067e50c3ad914575a70ab9b920eb5706/FLAGc25eaf8e4 [2020-07-29 01:37:15,074 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:37:15,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2020-07-29 01:37:15,088 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c513b68d1/067e50c3ad914575a70ab9b920eb5706/FLAGc25eaf8e4 [2020-07-29 01:37:15,378 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c513b68d1/067e50c3ad914575a70ab9b920eb5706 [2020-07-29 01:37:15,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:37:15,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:37:15,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:15,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:37:15,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:37:15,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:37:15" (1/1) ... [2020-07-29 01:37:15,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d9b99d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:15, skipping insertion in model container [2020-07-29 01:37:15,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:37:15" (1/1) ... [2020-07-29 01:37:15,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:37:15,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:37:15,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:15,869 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:37:15,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:16,018 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:37:16,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:16 WrapperNode [2020-07-29 01:37:16,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:16,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:16,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:37:16,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:37:16,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:16" (1/1) ... [2020-07-29 01:37:16,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:16" (1/1) ... [2020-07-29 01:37:16,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:16,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:37:16,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:37:16,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:37:16,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:16" (1/1) ... [2020-07-29 01:37:16,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:16" (1/1) ... [2020-07-29 01:37:16,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:16" (1/1) ... [2020-07-29 01:37:16,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:16" (1/1) ... [2020-07-29 01:37:16,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:16" (1/1) ... [2020-07-29 01:37:16,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:16" (1/1) ... [2020-07-29 01:37:16,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:16" (1/1) ... [2020-07-29 01:37:16,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:37:16,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:37:16,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:37:16,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:37:16,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:16" (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-07-29 01:37:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:37:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:37:16,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:37:16,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:37:16,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:37:16,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:37:16,628 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:37:16,628 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:37:16,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:16 BoogieIcfgContainer [2020-07-29 01:37:16,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:37:16,633 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:37:16,633 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:37:16,637 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:37:16,638 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:16,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:37:15" (1/3) ... [2020-07-29 01:37:16,639 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47ba9bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:16, skipping insertion in model container [2020-07-29 01:37:16,640 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:16,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:16" (2/3) ... [2020-07-29 01:37:16,640 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47ba9bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:16, skipping insertion in model container [2020-07-29 01:37:16,641 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:16,641 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:16" (3/3) ... [2020-07-29 01:37:16,643 INFO L371 chiAutomizerObserver]: Analyzing ICFG twisted-alloca.i [2020-07-29 01:37:16,698 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:37:16,699 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:37:16,699 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:37:16,699 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:37:16,699 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:37:16,700 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:37:16,700 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:37:16,700 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:37:16,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:37:16,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:37:16,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:16,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:16,742 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:37:16,742 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:37:16,742 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:37:16,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:37:16,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:37:16,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:16,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:16,746 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:37:16,747 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:37:16,753 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 3#L569true [2020-07-29 01:37:16,754 INFO L796 eck$LassoCheckResult]: Loop: 3#L569true assume !true; 8#L564true goto; 4#L567true call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 11#L564-1true assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 6#L566true assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 3#L569true [2020-07-29 01:37:16,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:16,759 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:37:16,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:16,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118809202] [2020-07-29 01:37:16,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:16,983 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:17,028 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:17,051 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:17,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:17,053 INFO L82 PathProgramCache]: Analyzing trace with hash 46885240, now seen corresponding path program 1 times [2020-07-29 01:37:17,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:17,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641406220] [2020-07-29 01:37:17,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:17,092 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#true} assume !true; {22#false} is VALID [2020-07-29 01:37:17,093 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#false} goto; {22#false} is VALID [2020-07-29 01:37:17,093 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#false} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {22#false} is VALID [2020-07-29 01:37:17,093 INFO L280 TraceCheckUtils]: 3: Hoare triple {22#false} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {22#false} is VALID [2020-07-29 01:37:17,094 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#false} assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; {22#false} is VALID [2020-07-29 01:37:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:17,096 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641406220] [2020-07-29 01:37:17,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:37:17,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-29 01:37:17,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029471821] [2020-07-29 01:37:17,103 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:37:17,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:17,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:37:17,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:37:17,118 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2020-07-29 01:37:17,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:17,159 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-07-29 01:37:17,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:37:17,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:37:17,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:17,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2020-07-29 01:37:17,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:37:17,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2020-07-29 01:37:17,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:37:17,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:37:17,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2020-07-29 01:37:17,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:37:17,189 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:37:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2020-07-29 01:37:17,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-29 01:37:17,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:17,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:37:17,211 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:37:17,213 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:37:17,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:17,215 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:37:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:37:17,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:17,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:17,217 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states and 13 transitions. [2020-07-29 01:37:17,217 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states and 13 transitions. [2020-07-29 01:37:17,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:17,219 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:37:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:37:17,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:17,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:17,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:17,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:37:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-07-29 01:37:17,223 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:37:17,223 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:37:17,223 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:37:17,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:37:17,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:37:17,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:17,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:17,225 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:37:17,225 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:17,226 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 38#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 39#L569 [2020-07-29 01:37:17,226 INFO L796 eck$LassoCheckResult]: Loop: 39#L569 goto; 42#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 46#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; 40#L564 goto; 41#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 44#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 45#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 39#L569 [2020-07-29 01:37:17,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:17,226 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-07-29 01:37:17,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:17,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820248686] [2020-07-29 01:37:17,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:17,294 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:17,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:17,359 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:17,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1311753714, now seen corresponding path program 1 times [2020-07-29 01:37:17,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:17,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288831587] [2020-07-29 01:37:17,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:17,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:17,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:17,402 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:17,402 INFO L82 PathProgramCache]: Analyzing trace with hash 234543116, now seen corresponding path program 1 times [2020-07-29 01:37:17,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:17,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112972289] [2020-07-29 01:37:17,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:17,435 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:17,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:17,489 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:17,764 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-07-29 01:37:18,450 WARN L193 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2020-07-29 01:37:18,742 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-07-29 01:37:18,757 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:18,758 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:18,758 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:18,758 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:18,759 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:18,759 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:18,759 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:18,759 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:18,759 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration2_Lasso [2020-07-29 01:37:18,760 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:18,760 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:18,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:18,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:19,659 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2020-07-29 01:37:19,844 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2020-07-29 01:37:19,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:19,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:19,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:21,118 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:21,124 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-07-29 01:37:21,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:21,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:21,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:21,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:21,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:21,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:21,169 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-07-29 01:37:21,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:21,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:21,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:21,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:21,220 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-07-29 01:37:21,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:21,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:21,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:21,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:21,251 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-07-29 01:37:21,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:21,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:21,261 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-07-29 01:37:21,305 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-07-29 01:37:21,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:21,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:21,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:21,314 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:21,350 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-07-29 01:37:21,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:21,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:21,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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:21,400 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-07-29 01:37:21,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:21,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:21,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:21,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:21,405 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-07-29 01:37:21,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:21,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:21,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:21,441 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-07-29 01:37:21,479 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-07-29 01:37:21,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:21,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:21,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:21,490 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-07-29 01:37:21,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:21,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:21,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:21,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:21,519 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-07-29 01:37:21,542 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-07-29 01:37:21,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:21,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:21,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:21,546 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) [2020-07-29 01:37:21,573 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:21,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:21,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:21,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:21,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:21,600 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-07-29 01:37:21,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:21,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:21,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:21,607 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-07-29 01:37:21,635 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-07-29 01:37:21,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:21,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:21,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07-29 01:37:21,669 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-07-29 01:37:21,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:21,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:21,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:21,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 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-07-29 01:37:21,698 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-07-29 01:37:21,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:21,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:21,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:21,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:21,730 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-07-29 01:37:21,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:21,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:21,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:21,734 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-07-29 01:37:21,760 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-07-29 01:37:21,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:21,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:21,769 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-07-29 01:37:21,795 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-07-29 01:37:21,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:21,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:21,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:21,854 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-07-29 01:37:21,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:21,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:21,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:21,915 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-07-29 01:37:21,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:21,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:21,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:21,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:21,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:21,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:21,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:21,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:21,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:21,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:21,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:22,014 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-07-29 01:37:22,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:22,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:22,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:22,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:22,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:22,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:22,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:22,044 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-07-29 01:37:22,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:22,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:22,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:22,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:22,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:22,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:22,064 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:22,176 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:37:22,177 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:22,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:22,221 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:37:22,222 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:22,222 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)_1 + 1 Supporting invariants [] [2020-07-29 01:37:22,467 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2020-07-29 01:37:22,475 INFO L393 LassoCheck]: Loop: "goto;" "call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4);" "assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;" "goto;" "call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4);" "assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4);" "assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14;" [2020-07-29 01:37:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:22,490 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:37:22,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:22,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:37:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:22,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:22,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {77#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {77#unseeded} is VALID [2020-07-29 01:37:22,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#unseeded} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); {77#unseeded} is VALID [2020-07-29 01:37:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:22,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:37:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:22,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:22,743 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2020-07-29 01:37:22,749 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:22,759 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:22,759 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:37:22,760 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2020-07-29 01:37:26,304 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:37:26,305 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_61|]. (let ((.cse1 (select |v_#memory_int_61| ULTIMATE.start_f_~j~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_f_~j~0.offset))) (and (<= 1 (+ (* 2 .cse0) oldRank0)) (<= .cse0 0) (= |#memory_int| (store |v_#memory_int_61| ULTIMATE.start_f_~j~0.base (store .cse1 ULTIMATE.start_f_~j~0.offset (+ .cse0 1))))))) [2020-07-29 01:37:26,305 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))) (and (<= .cse0 1) (<= 3 (+ oldRank0 (* 2 .cse0))))) [2020-07-29 01:37:26,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) 1))} goto; {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) 1))} is VALID [2020-07-29 01:37:26,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) 1))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) 1))} is VALID [2020-07-29 01:37:26,342 INFO L280 TraceCheckUtils]: 2: Hoare triple {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) 1))} assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) 1))} is VALID [2020-07-29 01:37:26,342 INFO L280 TraceCheckUtils]: 3: Hoare triple {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) 1))} goto; {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) 1))} is VALID [2020-07-29 01:37:26,343 INFO L280 TraceCheckUtils]: 4: Hoare triple {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) 1))} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {315#(and (<= 1 (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))) (<= (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) |ULTIMATE.start_f_#t~mem11|))} is VALID [2020-07-29 01:37:26,345 INFO L280 TraceCheckUtils]: 5: Hoare triple {315#(and (<= 1 (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))) (<= (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) |ULTIMATE.start_f_#t~mem11|))} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {319#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1) (<= 3 (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))))} is VALID [2020-07-29 01:37:26,346 INFO L280 TraceCheckUtils]: 6: Hoare triple {319#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1) (<= 3 (+ oldRank0 (* 2 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))))} assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; {295#(or (and (> oldRank0 (+ (* (- 2) (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:37:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:26,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:37:26,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:26,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:37:26,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,370 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:37:26,371 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-07-29 01:37:26,488 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 20 states and 27 transitions. Complement of second has 6 states. [2020-07-29 01:37:26,489 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-07-29 01:37:26,489 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:26,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:37:26,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:26,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:26,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:37:26,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:26,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:26,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:26,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2020-07-29 01:37:26,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:26,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:26,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:26,498 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:37:26,499 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:37:26,500 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:37:26,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:26,502 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:26,502 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 27 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:26,502 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:26,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:37:26,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:37:26,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:37:26,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:26,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:26,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:26,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:26,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:26,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:26,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:37:26,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:37:26,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:37:26,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:37:26,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:37:26,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:37:26,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:26,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:26,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:26,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:37:26,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:37:26,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:37:26,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:37:26,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:37:26,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:37:26,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:26,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:26,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:26,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:26,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:26,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:26,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:26,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:26,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:37:26,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:26,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:26,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:37:26,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:26,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:26,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:26,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:26,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:26,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:26,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:26,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:26,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:37:26,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:26,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:26,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:26,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:26,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:26,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:26,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:26,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:26,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:26,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,529 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:37:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:37:26,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:37:26,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:37:26,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 14 letters. [2020-07-29 01:37:26,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:26,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. cyclomatic complexity: 9 [2020-07-29 01:37:26,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:26,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 21 transitions. [2020-07-29 01:37:26,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:37:26,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:37:26,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-07-29 01:37:26,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:26,541 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 01:37:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-07-29 01:37:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-29 01:37:26,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:26,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 21 transitions. Second operand 15 states. [2020-07-29 01:37:26,545 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 21 transitions. Second operand 15 states. [2020-07-29 01:37:26,545 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 15 states. [2020-07-29 01:37:26,545 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:26,548 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-07-29 01:37:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-07-29 01:37:26,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:26,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:26,549 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states and 21 transitions. [2020-07-29 01:37:26,549 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states and 21 transitions. [2020-07-29 01:37:26,549 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:26,551 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-07-29 01:37:26,551 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2020-07-29 01:37:26,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:26,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:26,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:26,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:26,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:37:26,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-07-29 01:37:26,553 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 01:37:26,553 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 01:37:26,553 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:37:26,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:37:26,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:26,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:26,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:26,555 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:37:26,555 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:26,555 INFO L794 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 352#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 353#L569 goto; 357#L560 [2020-07-29 01:37:26,555 INFO L796 eck$LassoCheckResult]: Loop: 357#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 363#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 364#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 357#L560 [2020-07-29 01:37:26,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:26,556 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2020-07-29 01:37:26,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:26,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175178080] [2020-07-29 01:37:26,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:26,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:26,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:26,617 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2020-07-29 01:37:26,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:26,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246000076] [2020-07-29 01:37:26,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:26,639 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:26,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:26,660 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:26,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:26,661 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2020-07-29 01:37:26,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:26,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030119525] [2020-07-29 01:37:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:26,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:26,706 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:26,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:27,554 WARN L193 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2020-07-29 01:37:27,812 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-07-29 01:37:27,824 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:27,824 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:27,824 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:27,824 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:27,824 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:27,824 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:27,824 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:27,824 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:27,824 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration3_Lasso [2020-07-29 01:37:27,824 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:27,825 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:27,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:27,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:27,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:27,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:27,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:27,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:27,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:27,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:27,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:27,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:28,481 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2020-07-29 01:37:28,639 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-07-29 01:37:28,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:28,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:28,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:28,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:28,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:28,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:28,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:28,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:28,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:28,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:28,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:28,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:29,975 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:29,975 INFO L489 LassoAnalysis]: Using template 'affine'. 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-07-29 01:37:29,988 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-07-29 01:37:29,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:29,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:29,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:29,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:29,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:29,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:29,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:29,992 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-07-29 01:37:30,016 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-07-29 01:37:30,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:30,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:30,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:30,019 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-07-29 01:37:30,043 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-07-29 01:37:30,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:30,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:30,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:30,047 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-07-29 01:37:30,072 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-07-29 01:37:30,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,077 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-07-29 01:37:30,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:30,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,110 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-07-29 01:37:30,135 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-07-29 01:37:30,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,142 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:30,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-07-29 01:37:30,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:30,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:30,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:30,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:30,192 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-07-29 01:37:30,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:30,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:30,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:30,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:30,219 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-07-29 01:37:30,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:30,249 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-07-29 01:37:30,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:30,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:30,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:30,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:30,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:30,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-07-29 01:37:30,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,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 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-07-29 01:37:30,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-07-29 01:37:30,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,391 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-07-29 01:37:30,414 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-07-29 01:37:30,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,423 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-07-29 01:37:30,446 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-07-29 01:37:30,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,454 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) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:30,476 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-07-29 01:37:30,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,493 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) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:30,517 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-07-29 01:37:30,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,524 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-07-29 01:37:30,548 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-07-29 01:37:30,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,572 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-07-29 01:37:30,597 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-07-29 01:37:30,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,608 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-07-29 01:37:30,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:37:30,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,638 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-07-29 01:37:30,664 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-07-29 01:37:30,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:30,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:30,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:30,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:30,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:30,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:30,683 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:30,703 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:37:30,703 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:30,706 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:37:30,708 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:37:30,708 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:30,709 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_2 Supporting invariants [] [2020-07-29 01:37:30,915 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2020-07-29 01:37:30,919 INFO L393 LassoCheck]: Loop: "call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4);" "assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4);" "assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10;" [2020-07-29 01:37:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:30,925 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:37:30,925 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:37:30,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:30,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:37:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:30,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:30,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {442#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {442#unseeded} is VALID [2020-07-29 01:37:30,982 INFO L280 TraceCheckUtils]: 1: Hoare triple {442#unseeded} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); {442#unseeded} is VALID [2020-07-29 01:37:30,983 INFO L280 TraceCheckUtils]: 2: Hoare triple {442#unseeded} goto; {442#unseeded} is VALID [2020-07-29 01:37:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:30,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:37:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:31,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:31,126 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:31,127 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 65 [2020-07-29 01:37:31,160 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:37:31,177 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-29 01:37:31,204 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:31,238 INFO L624 ElimStorePlain]: treesize reduction 59, result has 37.9 percent of original size [2020-07-29 01:37:31,239 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:37:31,239 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:36 [2020-07-29 01:37:33,910 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:37:33,910 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_110|]. (let ((.cse3 (select |v_#memory_int_110| ULTIMATE.start_f_~i~0.base))) (let ((.cse2 (select .cse3 ULTIMATE.start_f_~i~0.offset))) (let ((.cse1 (select (select |v_#memory_int_110| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)) (.cse0 (+ .cse2 1))) (and (<= .cse0 .cse1) (<= .cse1 (+ .cse2 oldRank0)) (= (store |v_#memory_int_110| ULTIMATE.start_f_~i~0.base (store .cse3 ULTIMATE.start_f_~i~0.offset .cse0)) |#memory_int|))))) [2020-07-29 01:37:33,910 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (.cse0 (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset))) (and (or (not (= ULTIMATE.start_f_~i~0.offset ULTIMATE.start_f_~k_ref~0.offset)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base))) (<= (+ .cse0 1) (+ .cse1 oldRank0)) (<= .cse1 .cse0))) [2020-07-29 01:37:33,939 INFO L280 TraceCheckUtils]: 0: Hoare triple {445#(>= oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (* (- 1) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {646#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) |ULTIMATE.start_f_#t~mem6|) (<= |ULTIMATE.start_f_#t~mem7| (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) oldRank0)))} is VALID [2020-07-29 01:37:33,942 INFO L280 TraceCheckUtils]: 1: Hoare triple {646#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) |ULTIMATE.start_f_#t~mem6|) (<= |ULTIMATE.start_f_#t~mem7| (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) oldRank0)))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {650#(and (or (not (= ULTIMATE.start_f_~i~0.offset ULTIMATE.start_f_~k_ref~0.offset)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base))) (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)))} is VALID [2020-07-29 01:37:33,943 INFO L280 TraceCheckUtils]: 2: Hoare triple {650#(and (or (not (= ULTIMATE.start_f_~i~0.offset ULTIMATE.start_f_~k_ref~0.offset)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base))) (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)))} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {635#(or (and (> oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (* (- 1) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:37:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:33,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:37:33,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:33,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:33,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:33,954 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:37:33,955 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 01:37:34,039 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 34 states and 43 transitions. Complement of second has 7 states. [2020-07-29 01:37:34,039 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-07-29 01:37:34,039 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:34,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. cyclomatic complexity: 7 [2020-07-29 01:37:34,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:34,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:34,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:37:34,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:34,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:34,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:34,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2020-07-29 01:37:34,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:34,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:34,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:34,044 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 7 [2020-07-29 01:37:34,044 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:34,045 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:37:34,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:34,046 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:34,046 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 43 transitions. cyclomatic complexity: 13 [2020-07-29 01:37:34,047 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:34,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:34,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:34,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:34,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:34,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:34,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:34,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:37:34,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:37:34,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:37:34,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 34 letters. Loop has 34 letters. [2020-07-29 01:37:34,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 01:37:34,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 34 letters. Loop has 34 letters. [2020-07-29 01:37:34,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:37:34,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:37:34,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:37:34,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:34,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:34,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:37:34,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:34,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:34,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:34,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:34,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:34,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:37:34,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:34,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:34,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:37:34,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:34,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:34,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:37:34,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:37:34,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:37:34,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:37:34,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:37:34,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:37:34,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:37:34,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:34,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:34,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:37:34,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,059 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:37:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-29 01:37:34,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:37:34,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:37:34,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:37:34,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:34,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. cyclomatic complexity: 13 [2020-07-29 01:37:34,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:34,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 31 transitions. [2020-07-29 01:37:34,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:37:34,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:37:34,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2020-07-29 01:37:34,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:34,066 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-07-29 01:37:34,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2020-07-29 01:37:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2020-07-29 01:37:34,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:34,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 31 transitions. Second operand 21 states. [2020-07-29 01:37:34,068 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 31 transitions. Second operand 21 states. [2020-07-29 01:37:34,068 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 21 states. [2020-07-29 01:37:34,068 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:34,070 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2020-07-29 01:37:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-07-29 01:37:34,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:34,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:34,071 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 24 states and 31 transitions. [2020-07-29 01:37:34,071 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 24 states and 31 transitions. [2020-07-29 01:37:34,071 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:34,073 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2020-07-29 01:37:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-07-29 01:37:34,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:34,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:34,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:34,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 01:37:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2020-07-29 01:37:34,076 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-07-29 01:37:34,076 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-07-29 01:37:34,076 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:37:34,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:37:34,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:34,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:34,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:34,078 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:34,078 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:34,078 INFO L794 eck$LassoCheckResult]: Stem: 707#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 700#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 701#L569 goto; 702#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 710#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; 698#L564 goto; 699#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 705#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 706#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 711#L569 goto; 712#L560 [2020-07-29 01:37:34,078 INFO L796 eck$LassoCheckResult]: Loop: 712#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 708#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 709#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 712#L560 [2020-07-29 01:37:34,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:34,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1319097990, now seen corresponding path program 2 times [2020-07-29 01:37:34,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:34,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234095823] [2020-07-29 01:37:34,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:34,099 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:34,120 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:34,125 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:34,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:34,126 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2020-07-29 01:37:34,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:34,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497396932] [2020-07-29 01:37:34,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:34,132 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:34,137 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:34,139 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:34,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1702545424, now seen corresponding path program 1 times [2020-07-29 01:37:34,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:34,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022350519] [2020-07-29 01:37:34,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:34,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {819#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {819#true} is VALID [2020-07-29 01:37:34,335 INFO L280 TraceCheckUtils]: 1: Hoare triple {819#true} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); {821#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:34,336 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} goto; {821#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:34,339 INFO L280 TraceCheckUtils]: 3: Hoare triple {821#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {822#(and (= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) |ULTIMATE.start_f_#t~mem7|) (= 0 |ULTIMATE.start_f_#t~mem6|) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:34,340 INFO L280 TraceCheckUtils]: 4: Hoare triple {822#(and (= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) |ULTIMATE.start_f_#t~mem7|) (= 0 |ULTIMATE.start_f_#t~mem6|) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; {823#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) 0) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:34,342 INFO L280 TraceCheckUtils]: 5: Hoare triple {823#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) 0) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} goto; {823#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) 0) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:34,343 INFO L280 TraceCheckUtils]: 6: Hoare triple {823#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) 0) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {823#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) 0) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:34,345 INFO L280 TraceCheckUtils]: 7: Hoare triple {823#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) 0) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {824#(<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} is VALID [2020-07-29 01:37:34,346 INFO L280 TraceCheckUtils]: 8: Hoare triple {824#(<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; {824#(<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} is VALID [2020-07-29 01:37:34,346 INFO L280 TraceCheckUtils]: 9: Hoare triple {824#(<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} goto; {824#(<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} is VALID [2020-07-29 01:37:34,348 INFO L280 TraceCheckUtils]: 10: Hoare triple {824#(<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {825#(<= |ULTIMATE.start_f_#t~mem7| |ULTIMATE.start_f_#t~mem6|)} is VALID [2020-07-29 01:37:34,349 INFO L280 TraceCheckUtils]: 11: Hoare triple {825#(<= |ULTIMATE.start_f_#t~mem7| |ULTIMATE.start_f_#t~mem6|)} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {820#false} is VALID [2020-07-29 01:37:34,349 INFO L280 TraceCheckUtils]: 12: Hoare triple {820#false} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {820#false} is VALID [2020-07-29 01:37:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:34,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022350519] [2020-07-29 01:37:34,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102229405] [2020-07-29 01:37:34,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:37:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:34,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-29 01:37:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:34,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:34,479 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:34,480 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2020-07-29 01:37:34,481 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:34,500 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:34,680 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2020-07-29 01:37:34,681 INFO L350 Elim1Store]: treesize reduction 7, result has 92.5 percent of original size [2020-07-29 01:37:34,682 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 100 [2020-07-29 01:37:34,683 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:34,779 INFO L624 ElimStorePlain]: treesize reduction 48, result has 61.3 percent of original size [2020-07-29 01:37:34,815 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:37:34,815 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:157, output treesize:27 [2020-07-29 01:37:34,836 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:37:34,837 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_111|, ULTIMATE.start_f_~k, ULTIMATE.start_f_~l_ref~0.base, ULTIMATE.start_f_~l_ref~0.offset, ULTIMATE.start_f_~l, |v_#valid_146|, |ULTIMATE.start_f_#t~malloc3.base|]. (let ((.cse1 (store |v_#valid_146| ULTIMATE.start_f_~k_ref~0.base 1))) (let ((.cse0 (store .cse1 |ULTIMATE.start_f_#t~malloc3.base| 1))) (and (= 0 (select .cse0 ULTIMATE.start_f_~i~0.base)) (= 0 (select (store .cse0 ULTIMATE.start_f_~i~0.base 1) ULTIMATE.start_f_~j~0.base)) (= (select .cse1 |ULTIMATE.start_f_#t~malloc3.base|) 0) (= |#memory_int| (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |v_#memory_int_111| ULTIMATE.start_f_~k_ref~0.base (store (select |v_#memory_int_111| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset ULTIMATE.start_f_~k)))) (store .cse4 ULTIMATE.start_f_~l_ref~0.base (store (select .cse4 ULTIMATE.start_f_~l_ref~0.base) ULTIMATE.start_f_~l_ref~0.offset ULTIMATE.start_f_~l))))) (store .cse3 ULTIMATE.start_f_~i~0.base (store (select .cse3 ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset 0))))) (store .cse2 ULTIMATE.start_f_~j~0.base (store (select .cse2 ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset 0))))))) [2020-07-29 01:37:34,837 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))) [2020-07-29 01:37:35,060 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2020-07-29 01:37:35,062 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:35,075 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:35,085 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-29 01:37:35,086 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:38 [2020-07-29 01:37:47,192 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:37:47,192 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_112|, ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_~j~0.offset]. (let ((.cse1 (select |v_#memory_int_112| ULTIMATE.start_f_~j~0.base))) (let ((.cse0 (select (select |v_#memory_int_112| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (.cse2 (select .cse1 ULTIMATE.start_f_~j~0.offset))) (and (= 0 .cse0) (<= (select (select |v_#memory_int_112| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) .cse0) (= |#memory_int| (store |v_#memory_int_112| ULTIMATE.start_f_~j~0.base (store .cse1 ULTIMATE.start_f_~j~0.offset (+ .cse2 1)))) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 .cse2) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base))))) [2020-07-29 01:37:47,192 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_~j~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))) (and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) .cse0) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 .cse0))) [2020-07-29 01:37:47,534 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2020-07-29 01:37:47,558 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:47,572 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:47,593 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:37:47,593 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:52, output treesize:7 [2020-07-29 01:37:47,600 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:37:47,600 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_f_~k_ref~0.base, ULTIMATE.start_f_~k_ref~0.offset, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~i~0.offset, ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_~j~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)) (.cse1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))) (and (<= .cse0 .cse1) (<= .cse1 |ULTIMATE.start_f_#t~mem6|) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (<= |ULTIMATE.start_f_#t~mem7| .cse0) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 .cse1))) [2020-07-29 01:37:47,600 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= |ULTIMATE.start_f_#t~mem7| 0) (<= 0 |ULTIMATE.start_f_#t~mem6|)) [2020-07-29 01:37:47,670 INFO L280 TraceCheckUtils]: 0: Hoare triple {819#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {819#true} is VALID [2020-07-29 01:37:47,674 INFO L280 TraceCheckUtils]: 1: Hoare triple {819#true} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); {832#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:47,675 INFO L280 TraceCheckUtils]: 2: Hoare triple {832#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} goto; {832#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:47,677 INFO L280 TraceCheckUtils]: 3: Hoare triple {832#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {839#(and (<= |ULTIMATE.start_f_#t~mem6| (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) |ULTIMATE.start_f_#t~mem7|) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:47,678 INFO L280 TraceCheckUtils]: 4: Hoare triple {839#(and (<= |ULTIMATE.start_f_#t~mem6| (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) |ULTIMATE.start_f_#t~mem7|) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; {843#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:47,679 INFO L280 TraceCheckUtils]: 5: Hoare triple {843#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} goto; {843#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:47,680 INFO L280 TraceCheckUtils]: 6: Hoare triple {843#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {843#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:47,684 INFO L280 TraceCheckUtils]: 7: Hoare triple {843#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {853#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (exists ((ULTIMATE.start_f_~j~0.base Int) (ULTIMATE.start_f_~j~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)))) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:47,688 INFO L280 TraceCheckUtils]: 8: Hoare triple {853#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (exists ((ULTIMATE.start_f_~j~0.base Int) (ULTIMATE.start_f_~j~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)))) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; {853#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (exists ((ULTIMATE.start_f_~j~0.base Int) (ULTIMATE.start_f_~j~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)))) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:47,690 INFO L280 TraceCheckUtils]: 9: Hoare triple {853#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (exists ((ULTIMATE.start_f_~j~0.base Int) (ULTIMATE.start_f_~j~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)))) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} goto; {853#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (exists ((ULTIMATE.start_f_~j~0.base Int) (ULTIMATE.start_f_~j~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)))) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:47,691 INFO L280 TraceCheckUtils]: 10: Hoare triple {853#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (exists ((ULTIMATE.start_f_~j~0.base Int) (ULTIMATE.start_f_~j~0.offset Int)) (and (= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~j~0.base)))) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {863#(and (<= |ULTIMATE.start_f_#t~mem7| 0) (<= 0 |ULTIMATE.start_f_#t~mem6|))} is VALID [2020-07-29 01:37:47,692 INFO L280 TraceCheckUtils]: 11: Hoare triple {863#(and (<= |ULTIMATE.start_f_#t~mem7| 0) (<= 0 |ULTIMATE.start_f_#t~mem6|))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {820#false} is VALID [2020-07-29 01:37:47,692 INFO L280 TraceCheckUtils]: 12: Hoare triple {820#false} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {820#false} is VALID [2020-07-29 01:37:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:47,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:37:47,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-07-29 01:37:47,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80133700] [2020-07-29 01:37:47,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:47,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:37:47,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:37:47,847 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 12 states. [2020-07-29 01:37:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:48,534 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2020-07-29 01:37:48,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:37:48,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:37:48,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:48,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2020-07-29 01:37:48,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:48,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 22 states and 28 transitions. [2020-07-29 01:37:48,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:37:48,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:37:48,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2020-07-29 01:37:48,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:48,600 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-29 01:37:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2020-07-29 01:37:48,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-07-29 01:37:48,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:48,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 28 transitions. Second operand 20 states. [2020-07-29 01:37:48,607 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 28 transitions. Second operand 20 states. [2020-07-29 01:37:48,607 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 20 states. [2020-07-29 01:37:48,608 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:48,609 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-29 01:37:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-29 01:37:48,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:48,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:48,610 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states and 28 transitions. [2020-07-29 01:37:48,610 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states and 28 transitions. [2020-07-29 01:37:48,611 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:48,612 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-29 01:37:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-29 01:37:48,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:48,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:48,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:48,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:37:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-07-29 01:37:48,614 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 01:37:48,615 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 01:37:48,615 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:37:48,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-07-29 01:37:48,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:48,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:48,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:48,616 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:48,616 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:48,616 INFO L794 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 921#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 922#L569 goto; 925#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 933#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 934#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 923#L564 goto; 924#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 929#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 930#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 935#L569 goto; 936#L560 [2020-07-29 01:37:48,617 INFO L796 eck$LassoCheckResult]: Loop: 936#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 931#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 932#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 936#L560 [2020-07-29 01:37:48,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:48,617 INFO L82 PathProgramCache]: Analyzing trace with hash -635175977, now seen corresponding path program 1 times [2020-07-29 01:37:48,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:48,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280661092] [2020-07-29 01:37:48,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:48,728 INFO L280 TraceCheckUtils]: 0: Hoare triple {1038#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1038#true} is VALID [2020-07-29 01:37:48,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {1038#true} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); {1040#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} is VALID [2020-07-29 01:37:48,732 INFO L280 TraceCheckUtils]: 2: Hoare triple {1040#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} goto; {1040#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} is VALID [2020-07-29 01:37:48,733 INFO L280 TraceCheckUtils]: 3: Hoare triple {1040#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {1040#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} is VALID [2020-07-29 01:37:48,734 INFO L280 TraceCheckUtils]: 4: Hoare triple {1040#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {1041#(not (= |ULTIMATE.start_f_#t~mem10| (* 2 (div |ULTIMATE.start_f_#t~mem10| 2))))} is VALID [2020-07-29 01:37:48,736 INFO L280 TraceCheckUtils]: 5: Hoare triple {1041#(not (= |ULTIMATE.start_f_#t~mem10| (* 2 (div |ULTIMATE.start_f_#t~mem10| 2))))} assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; {1039#false} is VALID [2020-07-29 01:37:48,736 INFO L280 TraceCheckUtils]: 6: Hoare triple {1039#false} goto; {1039#false} is VALID [2020-07-29 01:37:48,736 INFO L280 TraceCheckUtils]: 7: Hoare triple {1039#false} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {1039#false} is VALID [2020-07-29 01:37:48,736 INFO L280 TraceCheckUtils]: 8: Hoare triple {1039#false} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {1039#false} is VALID [2020-07-29 01:37:48,737 INFO L280 TraceCheckUtils]: 9: Hoare triple {1039#false} assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; {1039#false} is VALID [2020-07-29 01:37:48,737 INFO L280 TraceCheckUtils]: 10: Hoare triple {1039#false} goto; {1039#false} is VALID [2020-07-29 01:37:48,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:48,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280661092] [2020-07-29 01:37:48,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:37:48,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:37:48,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674015429] [2020-07-29 01:37:48,738 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:37:48,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:48,739 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2020-07-29 01:37:48,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:48,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561484243] [2020-07-29 01:37:48,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:48,745 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:48,750 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:48,752 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:48,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:48,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:37:48,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:37:48,895 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:37:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:48,968 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-07-29 01:37:48,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:37:48,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:37:48,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:49,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2020-07-29 01:37:49,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:49,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2020-07-29 01:37:49,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:37:49,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:37:49,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2020-07-29 01:37:49,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:49,005 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-07-29 01:37:49,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2020-07-29 01:37:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-29 01:37:49,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:49,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 30 transitions. Second operand 23 states. [2020-07-29 01:37:49,008 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 30 transitions. Second operand 23 states. [2020-07-29 01:37:49,008 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand 23 states. [2020-07-29 01:37:49,009 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:49,011 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-07-29 01:37:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2020-07-29 01:37:49,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:49,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:49,011 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states and 30 transitions. [2020-07-29 01:37:49,012 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states and 30 transitions. [2020-07-29 01:37:49,012 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:49,014 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-07-29 01:37:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2020-07-29 01:37:49,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:49,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:49,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:49,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:37:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2020-07-29 01:37:49,016 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-07-29 01:37:49,016 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-07-29 01:37:49,016 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:37:49,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-07-29 01:37:49,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:49,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:49,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:49,018 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:49,018 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:49,018 INFO L794 eck$LassoCheckResult]: Stem: 1076#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1067#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 1068#L569 goto; 1071#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1088#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1085#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1083#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1084#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; 1069#L564 goto; 1070#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1074#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1075#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 1081#L569 goto; 1082#L560 [2020-07-29 01:37:49,018 INFO L796 eck$LassoCheckResult]: Loop: 1082#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1077#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1078#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1082#L560 [2020-07-29 01:37:49,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:49,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1431192234, now seen corresponding path program 2 times [2020-07-29 01:37:49,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:49,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683805489] [2020-07-29 01:37:49,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:49,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {1189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1189#true} is VALID [2020-07-29 01:37:49,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {1189#true} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); {1191#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:49,221 INFO L280 TraceCheckUtils]: 2: Hoare triple {1191#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} goto; {1191#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:49,223 INFO L280 TraceCheckUtils]: 3: Hoare triple {1191#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {1191#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:49,225 INFO L280 TraceCheckUtils]: 4: Hoare triple {1191#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {1192#(and (<= 1 (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (<= (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))} is VALID [2020-07-29 01:37:49,230 INFO L280 TraceCheckUtils]: 5: Hoare triple {1192#(and (<= 1 (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (<= (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {1192#(and (<= 1 (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (<= (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))} is VALID [2020-07-29 01:37:49,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {1192#(and (<= 1 (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (<= (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {1192#(and (<= 1 (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (<= (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))} is VALID [2020-07-29 01:37:49,234 INFO L280 TraceCheckUtils]: 7: Hoare triple {1192#(and (<= 1 (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (<= (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))} assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; {1192#(and (<= 1 (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (<= (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))} is VALID [2020-07-29 01:37:49,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {1192#(and (<= 1 (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (<= (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))} goto; {1192#(and (<= 1 (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (<= (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))} is VALID [2020-07-29 01:37:49,238 INFO L280 TraceCheckUtils]: 9: Hoare triple {1192#(and (<= 1 (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (<= (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {1192#(and (<= 1 (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (<= (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))} is VALID [2020-07-29 01:37:49,240 INFO L280 TraceCheckUtils]: 10: Hoare triple {1192#(and (<= 1 (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (<= (select (select (store |#memory_int| ULTIMATE.start_f_~j~0.base (store (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {1193#(not (= (* 2 (div |ULTIMATE.start_f_#t~mem14| 2)) |ULTIMATE.start_f_#t~mem14|))} is VALID [2020-07-29 01:37:49,242 INFO L280 TraceCheckUtils]: 11: Hoare triple {1193#(not (= (* 2 (div |ULTIMATE.start_f_#t~mem14| 2)) |ULTIMATE.start_f_#t~mem14|))} assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; {1190#false} is VALID [2020-07-29 01:37:49,242 INFO L280 TraceCheckUtils]: 12: Hoare triple {1190#false} goto; {1190#false} is VALID [2020-07-29 01:37:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:49,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683805489] [2020-07-29 01:37:49,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400944182] [2020-07-29 01:37:49,244 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:37:49,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:37:49,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:37:49,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:37:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:49,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:49,353 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2020-07-29 01:37:49,358 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:49,380 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:49,584 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-07-29 01:37:49,585 INFO L350 Elim1Store]: treesize reduction 44, result has 72.5 percent of original size [2020-07-29 01:37:49,586 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 130 [2020-07-29 01:37:49,587 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:49,707 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-07-29 01:37:49,708 INFO L624 ElimStorePlain]: treesize reduction 64, result has 54.9 percent of original size [2020-07-29 01:37:49,736 INFO L544 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:37:49,736 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:138, output treesize:19 [2020-07-29 01:37:49,744 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:37:49,744 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_117|, ULTIMATE.start_f_~k_ref~0.base, ULTIMATE.start_f_~k_ref~0.offset, ULTIMATE.start_f_~k, ULTIMATE.start_f_~l_ref~0.base, ULTIMATE.start_f_~l_ref~0.offset, ULTIMATE.start_f_~l, |v_#valid_149|, |ULTIMATE.start_f_#t~malloc2.base|, |ULTIMATE.start_f_#t~malloc3.base|]. (and (<= (select (store (store (store |v_#valid_149| |ULTIMATE.start_f_#t~malloc2.base| 1) |ULTIMATE.start_f_#t~malloc3.base| 1) ULTIMATE.start_f_~i~0.base 1) ULTIMATE.start_f_~j~0.base) 0) (= (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |v_#memory_int_117| ULTIMATE.start_f_~k_ref~0.base (store (select |v_#memory_int_117| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset ULTIMATE.start_f_~k)))) (store .cse2 ULTIMATE.start_f_~l_ref~0.base (store (select .cse2 ULTIMATE.start_f_~l_ref~0.base) ULTIMATE.start_f_~l_ref~0.offset ULTIMATE.start_f_~l))))) (store .cse1 ULTIMATE.start_f_~i~0.base (store (select .cse1 ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset 0))))) (store .cse0 ULTIMATE.start_f_~j~0.base (store (select .cse0 ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset 0))) |#memory_int|)) [2020-07-29 01:37:49,744 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))) [2020-07-29 01:37:49,795 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-07-29 01:37:49,796 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:49,805 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:49,806 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:37:49,806 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2020-07-29 01:37:53,378 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:37:53,379 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_118|]. (let ((.cse1 (select |v_#memory_int_118| ULTIMATE.start_f_~i~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_f_~i~0.offset))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_118| ULTIMATE.start_f_~i~0.base (store .cse1 ULTIMATE.start_f_~i~0.offset (+ .cse0 1)))) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |v_#memory_int_118| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))))) [2020-07-29 01:37:53,379 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))) [2020-07-29 01:37:53,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:37:53,464 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-07-29 01:37:53,465 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:37:53,471 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:37:53,480 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:37:53,481 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2020-07-29 01:37:53,484 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:37:53,484 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_119|, ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_~j~0.offset, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~i~0.offset]. (let ((.cse0 (select |v_#memory_int_119| ULTIMATE.start_f_~j~0.base))) (let ((.cse1 (select .cse0 ULTIMATE.start_f_~j~0.offset))) (and (= 1 (select (select |v_#memory_int_119| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (= |ULTIMATE.start_f_#t~mem14| (select (select (store |v_#memory_int_119| ULTIMATE.start_f_~j~0.base (store .cse0 ULTIMATE.start_f_~j~0.offset (+ .cse1 1))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (= 0 .cse1) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base))))) [2020-07-29 01:37:53,484 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 |ULTIMATE.start_f_#t~mem14|) [2020-07-29 01:37:53,498 INFO L280 TraceCheckUtils]: 0: Hoare triple {1189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1189#true} is VALID [2020-07-29 01:37:53,503 INFO L280 TraceCheckUtils]: 1: Hoare triple {1189#true} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); {1200#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:53,504 INFO L280 TraceCheckUtils]: 2: Hoare triple {1200#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} goto; {1200#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:53,505 INFO L280 TraceCheckUtils]: 3: Hoare triple {1200#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {1200#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:53,506 INFO L280 TraceCheckUtils]: 4: Hoare triple {1200#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {1210#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:53,507 INFO L280 TraceCheckUtils]: 5: Hoare triple {1210#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {1210#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:53,508 INFO L280 TraceCheckUtils]: 6: Hoare triple {1210#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {1210#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:53,509 INFO L280 TraceCheckUtils]: 7: Hoare triple {1210#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; {1210#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:53,509 INFO L280 TraceCheckUtils]: 8: Hoare triple {1210#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} goto; {1210#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:53,510 INFO L280 TraceCheckUtils]: 9: Hoare triple {1210#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {1210#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:37:53,511 INFO L280 TraceCheckUtils]: 10: Hoare triple {1210#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {1229#(= 1 |ULTIMATE.start_f_#t~mem14|)} is VALID [2020-07-29 01:37:53,512 INFO L280 TraceCheckUtils]: 11: Hoare triple {1229#(= 1 |ULTIMATE.start_f_#t~mem14|)} assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; {1190#false} is VALID [2020-07-29 01:37:53,512 INFO L280 TraceCheckUtils]: 12: Hoare triple {1190#false} goto; {1190#false} is VALID [2020-07-29 01:37:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:53,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:37:53,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-29 01:37:53,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223930159] [2020-07-29 01:37:53,514 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:37:53,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:53,514 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2020-07-29 01:37:53,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:53,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564344767] [2020-07-29 01:37:53,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:53,520 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:53,524 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:53,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:53,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:53,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:37:53,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:37:53,683 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 8 states. [2020-07-29 01:37:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:53,929 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-07-29 01:37:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:37:53,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:37:53,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:53,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2020-07-29 01:37:53,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:53,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 25 states and 31 transitions. [2020-07-29 01:37:53,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:37:53,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:37:53,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2020-07-29 01:37:53,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:37:53,990 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-07-29 01:37:53,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2020-07-29 01:37:53,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-07-29 01:37:53,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:53,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 31 transitions. Second operand 23 states. [2020-07-29 01:37:53,992 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 31 transitions. Second operand 23 states. [2020-07-29 01:37:53,992 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 23 states. [2020-07-29 01:37:53,992 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:53,994 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2020-07-29 01:37:53,994 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2020-07-29 01:37:53,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:53,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:53,995 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 25 states and 31 transitions. [2020-07-29 01:37:53,995 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 25 states and 31 transitions. [2020-07-29 01:37:53,995 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:37:53,997 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2020-07-29 01:37:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2020-07-29 01:37:53,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:53,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:53,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:53,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:37:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2020-07-29 01:37:53,999 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-07-29 01:37:53,999 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-07-29 01:37:53,999 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:37:53,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2020-07-29 01:37:54,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:37:54,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:54,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:54,001 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:54,001 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:37:54,001 INFO L794 eck$LassoCheckResult]: Stem: 1277#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1270#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 1271#L569 goto; 1274#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1290#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1288#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1289#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1282#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1283#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 1272#L564 goto; 1273#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1278#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1279#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 1284#L569 goto; 1285#L560 [2020-07-29 01:37:54,001 INFO L796 eck$LassoCheckResult]: Loop: 1285#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1280#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1281#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1285#L560 [2020-07-29 01:37:54,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:54,001 INFO L82 PathProgramCache]: Analyzing trace with hash 184869755, now seen corresponding path program 1 times [2020-07-29 01:37:54,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:54,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162554072] [2020-07-29 01:37:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:54,026 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:54,043 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:54,049 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:54,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:54,050 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 5 times [2020-07-29 01:37:54,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:54,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679516458] [2020-07-29 01:37:54,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:54,055 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:54,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:54,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:54,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:54,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1306804847, now seen corresponding path program 2 times [2020-07-29 01:37:54,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:54,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614104039] [2020-07-29 01:37:54,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:54,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:54,114 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:54,126 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:56,807 WARN L193 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 199 DAG size of output: 144 [2020-07-29 01:37:57,668 WARN L193 SmtUtils]: Spent 814.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-07-29 01:37:57,673 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:57,673 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:57,674 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:57,674 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:57,674 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:57,674 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:57,674 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:57,674 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:57,674 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration7_Lasso [2020-07-29 01:37:57,674 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:57,675 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:57,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:57,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,547 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2020-07-29 01:37:58,711 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-07-29 01:37:58,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,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-07-29 01:37:58,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-07-29 01:37:58,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-07-29 01:37:58,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,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-07-29 01:37:58,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,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-07-29 01:37:58,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,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-07-29 01:37:58,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:58,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:00,206 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:00,206 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:00,212 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-07-29 01:38:00,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:00,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:00,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:00,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:00,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:00,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:00,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:00,215 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-07-29 01:38:00,249 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-07-29 01:38:00,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:00,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:00,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:00,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:00,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:00,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:00,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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:00,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:38:00,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:00,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:00,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:00,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:00,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:00,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:00,300 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:00,326 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-07-29 01:38:00,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:00,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:00,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:00,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:00,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:00,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:00,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:00,364 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-07-29 01:38:00,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:00,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:00,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:00,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:00,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:00,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:00,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:00,394 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-07-29 01:38:00,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:00,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:00,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:00,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:00,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:00,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:00,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:00,453 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:00,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:00,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:00,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:00,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:00,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:00,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:00,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:00,481 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-07-29 01:38:00,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:00,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:00,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:00,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:00,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:00,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:00,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:00,510 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-07-29 01:38:00,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:00,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:00,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:00,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:00,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:00,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:00,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:00,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:38:00,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:00,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:00,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:00,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:00,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:00,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:00,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:00,571 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-07-29 01:38:00,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:00,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:00,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:00,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:00,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:00,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:00,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:00,622 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:00,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:00,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:00,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:00,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:00,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:00,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:00,640 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:00,655 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:38:00,655 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:00,658 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:38:00,660 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:38:00,660 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:00,660 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)_3 Supporting invariants [] [2020-07-29 01:38:00,871 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2020-07-29 01:38:00,875 INFO L393 LassoCheck]: Loop: "call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4);" "assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4);" "assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10;" [2020-07-29 01:38:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:00,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:38:00,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:38:00,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:00,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:38:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:00,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:00,947 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1414#unseeded} is VALID [2020-07-29 01:38:00,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#unseeded} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); {1414#unseeded} is VALID [2020-07-29 01:38:00,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {1414#unseeded} goto; {1414#unseeded} is VALID [2020-07-29 01:38:00,950 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#unseeded} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {1414#unseeded} is VALID [2020-07-29 01:38:00,950 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#unseeded} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {1414#unseeded} is VALID [2020-07-29 01:38:00,951 INFO L280 TraceCheckUtils]: 5: Hoare triple {1414#unseeded} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {1414#unseeded} is VALID [2020-07-29 01:38:00,951 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#unseeded} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {1414#unseeded} is VALID [2020-07-29 01:38:00,952 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#unseeded} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {1414#unseeded} is VALID [2020-07-29 01:38:00,952 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#unseeded} assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; {1414#unseeded} is VALID [2020-07-29 01:38:00,953 INFO L280 TraceCheckUtils]: 9: Hoare triple {1414#unseeded} goto; {1414#unseeded} is VALID [2020-07-29 01:38:00,953 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#unseeded} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {1414#unseeded} is VALID [2020-07-29 01:38:00,954 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#unseeded} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {1414#unseeded} is VALID [2020-07-29 01:38:00,954 INFO L280 TraceCheckUtils]: 12: Hoare triple {1414#unseeded} assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; {1414#unseeded} is VALID [2020-07-29 01:38:00,955 INFO L280 TraceCheckUtils]: 13: Hoare triple {1414#unseeded} goto; {1414#unseeded} is VALID [2020-07-29 01:38:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:00,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:38:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:00,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:01,121 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:38:01,122 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 65 [2020-07-29 01:38:01,155 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:38:01,166 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-29 01:38:01,200 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:38:01,242 INFO L624 ElimStorePlain]: treesize reduction 59, result has 37.9 percent of original size [2020-07-29 01:38:01,242 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:38:01,243 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:36 [2020-07-29 01:38:04,996 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:38:04,996 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_173|]. (let ((.cse0 (select |v_#memory_int_173| ULTIMATE.start_f_~i~0.base))) (let ((.cse3 (select .cse0 ULTIMATE.start_f_~i~0.offset))) (let ((.cse1 (+ .cse3 1)) (.cse2 (select (select |v_#memory_int_173| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset))) (and (= |#memory_int| (store |v_#memory_int_173| ULTIMATE.start_f_~i~0.base (store .cse0 ULTIMATE.start_f_~i~0.offset .cse1))) (<= .cse1 .cse2) (<= .cse2 (+ .cse3 oldRank0)))))) [2020-07-29 01:38:04,996 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (.cse0 (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset))) (and (or (not (= ULTIMATE.start_f_~i~0.offset ULTIMATE.start_f_~k_ref~0.offset)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base))) (<= (+ .cse0 1) (+ .cse1 oldRank0)) (<= .cse1 .cse0))) [2020-07-29 01:38:05,028 INFO L280 TraceCheckUtils]: 0: Hoare triple {1417#(>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {1651#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) |ULTIMATE.start_f_#t~mem6|) (<= |ULTIMATE.start_f_#t~mem7| (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) oldRank0)))} is VALID [2020-07-29 01:38:05,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {1651#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) |ULTIMATE.start_f_#t~mem6|) (<= |ULTIMATE.start_f_#t~mem7| (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) oldRank0)))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {1655#(and (or (not (= ULTIMATE.start_f_~i~0.offset ULTIMATE.start_f_~k_ref~0.offset)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base))) (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)))} is VALID [2020-07-29 01:38:05,033 INFO L280 TraceCheckUtils]: 2: Hoare triple {1655#(and (or (not (= ULTIMATE.start_f_~i~0.offset ULTIMATE.start_f_~k_ref~0.offset)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base))) (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)))} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {1607#(or (and (> oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:38:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:05,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:38:05,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:05,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:05,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,053 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:38:05,053 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:38:05,138 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 34 states and 42 transitions. Complement of second has 7 states. [2020-07-29 01:38:05,138 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-07-29 01:38:05,138 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:05,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. cyclomatic complexity: 9 [2020-07-29 01:38:05,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:05,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:05,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:38:05,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:38:05,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:05,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:05,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2020-07-29 01:38:05,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:38:05,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:05,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:05,141 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 29 transitions. cyclomatic complexity: 9 [2020-07-29 01:38:05,142 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:38:05,142 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:38:05,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:38:05,144 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:05,144 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 42 transitions. cyclomatic complexity: 11 [2020-07-29 01:38:05,144 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:38:05,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:05,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:05,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:05,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:05,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:05,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:05,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:05,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:05,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:05,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 34 letters. Loop has 34 letters. [2020-07-29 01:38:05,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 01:38:05,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 34 letters. Loop has 34 letters. [2020-07-29 01:38:05,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:05,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:05,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:05,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:38:05,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:38:05,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:38:05,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:38:05,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:38:05,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:38:05,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:05,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:05,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:05,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:05,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:05,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:05,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:05,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:05,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:05,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:05,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:05,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:05,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:38:05,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:38:05,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:38:05,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:05,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:05,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:05,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,154 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:38:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-29 01:38:05,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:05,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:05,155 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:38:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:05,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:38:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:05,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:05,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {1414#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1414#unseeded} is VALID [2020-07-29 01:38:05,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#unseeded} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); {1414#unseeded} is VALID [2020-07-29 01:38:05,221 INFO L280 TraceCheckUtils]: 2: Hoare triple {1414#unseeded} goto; {1414#unseeded} is VALID [2020-07-29 01:38:05,222 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#unseeded} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {1414#unseeded} is VALID [2020-07-29 01:38:05,222 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#unseeded} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {1414#unseeded} is VALID [2020-07-29 01:38:05,223 INFO L280 TraceCheckUtils]: 5: Hoare triple {1414#unseeded} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {1414#unseeded} is VALID [2020-07-29 01:38:05,223 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#unseeded} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {1414#unseeded} is VALID [2020-07-29 01:38:05,228 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#unseeded} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {1414#unseeded} is VALID [2020-07-29 01:38:05,229 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#unseeded} assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; {1414#unseeded} is VALID [2020-07-29 01:38:05,230 INFO L280 TraceCheckUtils]: 9: Hoare triple {1414#unseeded} goto; {1414#unseeded} is VALID [2020-07-29 01:38:05,230 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#unseeded} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {1414#unseeded} is VALID [2020-07-29 01:38:05,231 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#unseeded} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {1414#unseeded} is VALID [2020-07-29 01:38:05,231 INFO L280 TraceCheckUtils]: 12: Hoare triple {1414#unseeded} assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; {1414#unseeded} is VALID [2020-07-29 01:38:05,232 INFO L280 TraceCheckUtils]: 13: Hoare triple {1414#unseeded} goto; {1414#unseeded} is VALID [2020-07-29 01:38:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:05,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:38:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:05,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:05,394 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:38:05,395 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 65 [2020-07-29 01:38:05,429 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:38:05,441 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-29 01:38:05,464 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:38:05,503 INFO L624 ElimStorePlain]: treesize reduction 59, result has 37.9 percent of original size [2020-07-29 01:38:05,503 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:38:05,503 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:36 [2020-07-29 01:38:09,091 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:38:09,091 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_174|]. (let ((.cse2 (select |v_#memory_int_174| ULTIMATE.start_f_~i~0.base))) (let ((.cse3 (select .cse2 ULTIMATE.start_f_~i~0.offset))) (let ((.cse0 (+ .cse3 1)) (.cse1 (select (select |v_#memory_int_174| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset))) (and (<= .cse0 .cse1) (= |#memory_int| (store |v_#memory_int_174| ULTIMATE.start_f_~i~0.base (store .cse2 ULTIMATE.start_f_~i~0.offset .cse0))) (<= .cse1 (+ .cse3 oldRank0)))))) [2020-07-29 01:38:09,091 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (.cse0 (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset))) (and (or (not (= ULTIMATE.start_f_~i~0.offset ULTIMATE.start_f_~k_ref~0.offset)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base))) (<= (+ .cse0 1) (+ .cse1 oldRank0)) (<= .cse1 .cse0))) [2020-07-29 01:38:09,127 INFO L280 TraceCheckUtils]: 0: Hoare triple {1417#(>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {1746#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) |ULTIMATE.start_f_#t~mem6|) (<= |ULTIMATE.start_f_#t~mem7| (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) oldRank0)))} is VALID [2020-07-29 01:38:09,130 INFO L280 TraceCheckUtils]: 1: Hoare triple {1746#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) |ULTIMATE.start_f_#t~mem6|) (<= |ULTIMATE.start_f_#t~mem7| (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) oldRank0)))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {1750#(and (or (not (= ULTIMATE.start_f_~i~0.offset ULTIMATE.start_f_~k_ref~0.offset)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base))) (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)))} is VALID [2020-07-29 01:38:09,132 INFO L280 TraceCheckUtils]: 2: Hoare triple {1750#(and (or (not (= ULTIMATE.start_f_~i~0.offset ULTIMATE.start_f_~k_ref~0.offset)) (not (= ULTIMATE.start_f_~k_ref~0.base ULTIMATE.start_f_~i~0.base))) (<= (+ (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset)))} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {1607#(or (and (> oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (select (select |#memory_int| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:38:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:09,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:38:09,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:09,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:09,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,150 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:38:09,150 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:38:09,282 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 61 states and 76 transitions. Complement of second has 9 states. [2020-07-29 01:38:09,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:38:09,283 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:09,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. cyclomatic complexity: 9 [2020-07-29 01:38:09,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:09,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:09,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:38:09,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:38:09,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:09,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:09,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 76 transitions. [2020-07-29 01:38:09,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:38:09,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:09,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:09,286 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 29 transitions. cyclomatic complexity: 9 [2020-07-29 01:38:09,287 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:38:09,287 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:38:09,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:38:09,288 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:09,288 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 61 states and 76 transitions. cyclomatic complexity: 21 [2020-07-29 01:38:09,289 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:38:09,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:09,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:09,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:09,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:38:09,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:38:09,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:38:09,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:09,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:09,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:09,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 61 letters. Loop has 61 letters. [2020-07-29 01:38:09,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 61 letters. Loop has 61 letters. [2020-07-29 01:38:09,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 21 Stem has 61 letters. Loop has 61 letters. [2020-07-29 01:38:09,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:09,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:09,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 21 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:09,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:09,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:09,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:09,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:38:09,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:38:09,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:38:09,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:09,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:09,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:09,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:09,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:09,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:09,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:38:09,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:38:09,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:38:09,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:38:09,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:38:09,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:38:09,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:09,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:09,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:38:09,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:38:09,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:38:09,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 21 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:38:09,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,301 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:38:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2020-07-29 01:38:09,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:38:09,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:38:09,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:38:09,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:09,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. cyclomatic complexity: 21 [2020-07-29 01:38:09,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:38:09,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 45 states and 56 transitions. [2020-07-29 01:38:09,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:38:09,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:38:09,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2020-07-29 01:38:09,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:09,308 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2020-07-29 01:38:09,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2020-07-29 01:38:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2020-07-29 01:38:09,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:09,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 56 transitions. Second operand 41 states. [2020-07-29 01:38:09,311 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 56 transitions. Second operand 41 states. [2020-07-29 01:38:09,311 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 41 states. [2020-07-29 01:38:09,311 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:09,314 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2020-07-29 01:38:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2020-07-29 01:38:09,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:09,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:09,315 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 45 states and 56 transitions. [2020-07-29 01:38:09,315 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 45 states and 56 transitions. [2020-07-29 01:38:09,315 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:09,318 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2020-07-29 01:38:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2020-07-29 01:38:09,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:09,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:09,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:09,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-29 01:38:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2020-07-29 01:38:09,320 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2020-07-29 01:38:09,321 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2020-07-29 01:38:09,321 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:38:09,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 52 transitions. [2020-07-29 01:38:09,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:38:09,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:09,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:09,322 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:09,322 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:38:09,322 INFO L794 eck$LassoCheckResult]: Stem: 1837#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1828#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 1829#L569 goto; 1832#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1864#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1848#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1849#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1865#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1866#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1868#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1862#L557-1 assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; 1855#L564 goto; 1852#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 1854#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1851#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 1850#L569 goto; 1845#L560 [2020-07-29 01:38:09,322 INFO L796 eck$LassoCheckResult]: Loop: 1845#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 1839#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 1840#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 1845#L560 [2020-07-29 01:38:09,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:09,323 INFO L82 PathProgramCache]: Analyzing trace with hash 653741050, now seen corresponding path program 3 times [2020-07-29 01:38:09,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:09,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660820988] [2020-07-29 01:38:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:09,460 INFO L280 TraceCheckUtils]: 0: Hoare triple {2045#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2045#true} is VALID [2020-07-29 01:38:09,464 INFO L280 TraceCheckUtils]: 1: Hoare triple {2045#true} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); {2047#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} is VALID [2020-07-29 01:38:09,465 INFO L280 TraceCheckUtils]: 2: Hoare triple {2047#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} goto; {2047#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} is VALID [2020-07-29 01:38:09,468 INFO L280 TraceCheckUtils]: 3: Hoare triple {2047#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {2047#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} is VALID [2020-07-29 01:38:09,473 INFO L280 TraceCheckUtils]: 4: Hoare triple {2047#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {2048#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:38:09,474 INFO L280 TraceCheckUtils]: 5: Hoare triple {2048#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {2048#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:38:09,476 INFO L280 TraceCheckUtils]: 6: Hoare triple {2048#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {2048#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:38:09,478 INFO L280 TraceCheckUtils]: 7: Hoare triple {2048#(and (<= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1) (<= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {2049#(= |ULTIMATE.start_f_#t~mem10| (* 2 (div |ULTIMATE.start_f_#t~mem10| 2)))} is VALID [2020-07-29 01:38:09,480 INFO L280 TraceCheckUtils]: 8: Hoare triple {2049#(= |ULTIMATE.start_f_#t~mem10| (* 2 (div |ULTIMATE.start_f_#t~mem10| 2)))} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {2046#false} is VALID [2020-07-29 01:38:09,480 INFO L280 TraceCheckUtils]: 9: Hoare triple {2046#false} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {2046#false} is VALID [2020-07-29 01:38:09,480 INFO L280 TraceCheckUtils]: 10: Hoare triple {2046#false} assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; {2046#false} is VALID [2020-07-29 01:38:09,480 INFO L280 TraceCheckUtils]: 11: Hoare triple {2046#false} goto; {2046#false} is VALID [2020-07-29 01:38:09,481 INFO L280 TraceCheckUtils]: 12: Hoare triple {2046#false} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {2046#false} is VALID [2020-07-29 01:38:09,481 INFO L280 TraceCheckUtils]: 13: Hoare triple {2046#false} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {2046#false} is VALID [2020-07-29 01:38:09,481 INFO L280 TraceCheckUtils]: 14: Hoare triple {2046#false} assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; {2046#false} is VALID [2020-07-29 01:38:09,481 INFO L280 TraceCheckUtils]: 15: Hoare triple {2046#false} goto; {2046#false} is VALID [2020-07-29 01:38:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:09,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660820988] [2020-07-29 01:38:09,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127265008] [2020-07-29 01:38:09,482 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:38:09,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-29 01:38:09,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:38:09,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:38:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:09,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:09,586 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2020-07-29 01:38:09,589 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:38:09,599 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:38:09,609 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:38:09,609 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:4 [2020-07-29 01:38:09,612 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:38:09,613 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_212|, |ULTIMATE.start_f_#t~malloc2.base|, |ULTIMATE.start_f_#t~malloc3.base|]. (<= (select (store (store (store |v_#valid_212| |ULTIMATE.start_f_#t~malloc2.base| 1) |ULTIMATE.start_f_#t~malloc3.base| 1) ULTIMATE.start_f_~i~0.base 1) ULTIMATE.start_f_~j~0.base) 0) [2020-07-29 01:38:09,613 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) [2020-07-29 01:38:09,642 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-29 01:38:09,644 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:38:09,650 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:38:09,650 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:38:09,651 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:12 [2020-07-29 01:38:13,144 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:38:13,145 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_175|]. (and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= (store |v_#memory_int_175| ULTIMATE.start_f_~i~0.base (let ((.cse0 (select |v_#memory_int_175| ULTIMATE.start_f_~i~0.base))) (store .cse0 ULTIMATE.start_f_~i~0.offset (+ (select .cse0 ULTIMATE.start_f_~i~0.offset) 1)))) |#memory_int|) (= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) |ULTIMATE.start_f_#t~mem10|)) [2020-07-29 01:38:13,145 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) |ULTIMATE.start_f_#t~mem10|)) [2020-07-29 01:38:13,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:38:13,270 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2020-07-29 01:38:13,270 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:38:13,278 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:38:13,285 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:38:13,286 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:6 [2020-07-29 01:38:13,290 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:38:13,291 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_176|, ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_~j~0.offset, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~i~0.offset]. (and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (not (= 0 (mod (select (select |v_#memory_int_176| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 2))) (= (select (select (store |v_#memory_int_176| ULTIMATE.start_f_~j~0.base (let ((.cse0 (select |v_#memory_int_176| ULTIMATE.start_f_~j~0.base))) (store .cse0 ULTIMATE.start_f_~j~0.offset (+ (select .cse0 ULTIMATE.start_f_~j~0.offset) 1)))) ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) |ULTIMATE.start_f_#t~mem14|)) [2020-07-29 01:38:13,291 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= 0 (mod |ULTIMATE.start_f_#t~mem14| 2))) [2020-07-29 01:38:13,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {2045#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2045#true} is VALID [2020-07-29 01:38:13,368 INFO L280 TraceCheckUtils]: 1: Hoare triple {2045#true} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); {2056#(not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base))} is VALID [2020-07-29 01:38:13,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {2056#(not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base))} goto; {2056#(not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base))} is VALID [2020-07-29 01:38:13,370 INFO L280 TraceCheckUtils]: 3: Hoare triple {2056#(not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {2056#(not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base))} is VALID [2020-07-29 01:38:13,370 INFO L280 TraceCheckUtils]: 4: Hoare triple {2056#(not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {2056#(not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base))} is VALID [2020-07-29 01:38:13,371 INFO L280 TraceCheckUtils]: 5: Hoare triple {2056#(not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base))} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {2056#(not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base))} is VALID [2020-07-29 01:38:13,372 INFO L280 TraceCheckUtils]: 6: Hoare triple {2056#(not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {2056#(not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base))} is VALID [2020-07-29 01:38:13,379 INFO L280 TraceCheckUtils]: 7: Hoare triple {2056#(not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {2075#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) |ULTIMATE.start_f_#t~mem10|))} is VALID [2020-07-29 01:38:13,380 INFO L280 TraceCheckUtils]: 8: Hoare triple {2075#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) |ULTIMATE.start_f_#t~mem10|))} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {2079#(and (not (= 0 (mod (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 2))) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))} is VALID [2020-07-29 01:38:13,381 INFO L280 TraceCheckUtils]: 9: Hoare triple {2079#(and (not (= 0 (mod (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 2))) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {2079#(and (not (= 0 (mod (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 2))) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))} is VALID [2020-07-29 01:38:13,382 INFO L280 TraceCheckUtils]: 10: Hoare triple {2079#(and (not (= 0 (mod (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 2))) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))} assume !(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7; {2079#(and (not (= 0 (mod (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 2))) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))} is VALID [2020-07-29 01:38:13,382 INFO L280 TraceCheckUtils]: 11: Hoare triple {2079#(and (not (= 0 (mod (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 2))) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))} goto; {2079#(and (not (= 0 (mod (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 2))) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))} is VALID [2020-07-29 01:38:13,383 INFO L280 TraceCheckUtils]: 12: Hoare triple {2079#(and (not (= 0 (mod (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 2))) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {2079#(and (not (= 0 (mod (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 2))) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))} is VALID [2020-07-29 01:38:13,385 INFO L280 TraceCheckUtils]: 13: Hoare triple {2079#(and (not (= 0 (mod (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 2))) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {2095#(not (= 0 (mod |ULTIMATE.start_f_#t~mem14| 2)))} is VALID [2020-07-29 01:38:13,386 INFO L280 TraceCheckUtils]: 14: Hoare triple {2095#(not (= 0 (mod |ULTIMATE.start_f_#t~mem14| 2)))} assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; {2046#false} is VALID [2020-07-29 01:38:13,386 INFO L280 TraceCheckUtils]: 15: Hoare triple {2046#false} goto; {2046#false} is VALID [2020-07-29 01:38:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:38:13,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:38:13,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2020-07-29 01:38:13,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993991389] [2020-07-29 01:38:13,387 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:38:13,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:13,388 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 6 times [2020-07-29 01:38:13,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:13,388 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131530114] [2020-07-29 01:38:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:13,393 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:13,396 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:13,397 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:13,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:38:13,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:38:13,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:38:13,543 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. cyclomatic complexity: 16 Second operand 6 states. [2020-07-29 01:38:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:13,811 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2020-07-29 01:38:13,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:38:13,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:38:13,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:13,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. [2020-07-29 01:38:13,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:38:13,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 45 states and 55 transitions. [2020-07-29 01:38:13,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:38:13,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:38:13,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2020-07-29 01:38:13,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:13,851 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2020-07-29 01:38:13,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2020-07-29 01:38:13,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2020-07-29 01:38:13,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:13,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 55 transitions. Second operand 38 states. [2020-07-29 01:38:13,854 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 55 transitions. Second operand 38 states. [2020-07-29 01:38:13,854 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 38 states. [2020-07-29 01:38:13,854 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:13,856 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2020-07-29 01:38:13,856 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2020-07-29 01:38:13,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:13,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:13,857 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 45 states and 55 transitions. [2020-07-29 01:38:13,857 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 45 states and 55 transitions. [2020-07-29 01:38:13,857 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:13,859 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2020-07-29 01:38:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2020-07-29 01:38:13,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:13,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:13,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:13,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-29 01:38:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-07-29 01:38:13,861 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-07-29 01:38:13,861 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-07-29 01:38:13,861 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:38:13,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2020-07-29 01:38:13,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:38:13,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:13,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:13,862 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:13,863 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:38:13,863 INFO L794 eck$LassoCheckResult]: Stem: 2163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2156#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); 2157#L569 goto; 2158#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 2191#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 2171#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 2172#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 2188#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 2183#L559 assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; 2187#L564 goto; 2184#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 2161#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 2162#L566 assume 0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2);havoc f_#t~mem14; 2175#L567 call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); 2177#L564-1 assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); 2174#L566 assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; 2173#L569 goto; 2170#L560 [2020-07-29 01:38:13,863 INFO L796 eck$LassoCheckResult]: Loop: 2170#L560 call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); 2165#L557-1 assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); 2166#L559 assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; 2170#L560 [2020-07-29 01:38:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1305515858, now seen corresponding path program 1 times [2020-07-29 01:38:13,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:13,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759524032] [2020-07-29 01:38:13,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:13,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {2359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2359#true} is VALID [2020-07-29 01:38:13,979 INFO L280 TraceCheckUtils]: 1: Hoare triple {2359#true} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); {2361#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_f_~i~0.base (store (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))) ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))} is VALID [2020-07-29 01:38:13,980 INFO L280 TraceCheckUtils]: 2: Hoare triple {2361#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_f_~i~0.base (store (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))) ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))} goto; {2361#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_f_~i~0.base (store (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))) ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))} is VALID [2020-07-29 01:38:13,982 INFO L280 TraceCheckUtils]: 3: Hoare triple {2361#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_f_~i~0.base (store (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))) ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {2361#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_f_~i~0.base (store (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))) ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))} is VALID [2020-07-29 01:38:13,983 INFO L280 TraceCheckUtils]: 4: Hoare triple {2361#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_f_~i~0.base (store (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))) ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {2361#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_f_~i~0.base (store (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))) ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))} is VALID [2020-07-29 01:38:13,984 INFO L280 TraceCheckUtils]: 5: Hoare triple {2361#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_f_~i~0.base (store (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))) ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {2361#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_f_~i~0.base (store (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))) ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))} is VALID [2020-07-29 01:38:13,985 INFO L280 TraceCheckUtils]: 6: Hoare triple {2361#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_f_~i~0.base (store (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))) ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {2361#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_f_~i~0.base (store (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))) ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))} is VALID [2020-07-29 01:38:13,986 INFO L280 TraceCheckUtils]: 7: Hoare triple {2361#(and (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select (store |#memory_int| ULTIMATE.start_f_~i~0.base (store (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) 1))) ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {2362#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))} is VALID [2020-07-29 01:38:13,987 INFO L280 TraceCheckUtils]: 8: Hoare triple {2362#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))} assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; {2362#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))} is VALID [2020-07-29 01:38:13,987 INFO L280 TraceCheckUtils]: 9: Hoare triple {2362#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))} goto; {2362#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))} is VALID [2020-07-29 01:38:13,988 INFO L280 TraceCheckUtils]: 10: Hoare triple {2362#(= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {2363#(<= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))} is VALID [2020-07-29 01:38:13,989 INFO L280 TraceCheckUtils]: 11: Hoare triple {2363#(<= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {2364#(<= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))} is VALID [2020-07-29 01:38:13,990 INFO L280 TraceCheckUtils]: 12: Hoare triple {2364#(<= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))} assume 0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2);havoc f_#t~mem14; {2364#(<= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))} is VALID [2020-07-29 01:38:13,991 INFO L280 TraceCheckUtils]: 13: Hoare triple {2364#(<= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {2365#(<= 1 |ULTIMATE.start_f_#t~mem11|)} is VALID [2020-07-29 01:38:13,991 INFO L280 TraceCheckUtils]: 14: Hoare triple {2365#(<= 1 |ULTIMATE.start_f_#t~mem11|)} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {2360#false} is VALID [2020-07-29 01:38:13,991 INFO L280 TraceCheckUtils]: 15: Hoare triple {2360#false} assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; {2360#false} is VALID [2020-07-29 01:38:13,992 INFO L280 TraceCheckUtils]: 16: Hoare triple {2360#false} goto; {2360#false} is VALID [2020-07-29 01:38:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:38:13,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759524032] [2020-07-29 01:38:13,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435141632] [2020-07-29 01:38:13,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:38:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:14,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:38:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:14,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:14,107 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2020-07-29 01:38:14,110 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:38:14,125 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:38:14,330 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-07-29 01:38:14,330 INFO L350 Elim1Store]: treesize reduction 44, result has 72.5 percent of original size [2020-07-29 01:38:14,331 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 130 [2020-07-29 01:38:14,331 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:38:14,460 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-07-29 01:38:14,461 INFO L624 ElimStorePlain]: treesize reduction 64, result has 54.9 percent of original size [2020-07-29 01:38:14,487 INFO L544 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:38:14,487 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:138, output treesize:19 [2020-07-29 01:38:14,495 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:38:14,495 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_179|, ULTIMATE.start_f_~k_ref~0.base, ULTIMATE.start_f_~k_ref~0.offset, ULTIMATE.start_f_~k, ULTIMATE.start_f_~l_ref~0.base, ULTIMATE.start_f_~l_ref~0.offset, ULTIMATE.start_f_~l, |v_#valid_214|, |ULTIMATE.start_f_#t~malloc2.base|, |ULTIMATE.start_f_#t~malloc3.base|]. (and (= (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |v_#memory_int_179| ULTIMATE.start_f_~k_ref~0.base (store (select |v_#memory_int_179| ULTIMATE.start_f_~k_ref~0.base) ULTIMATE.start_f_~k_ref~0.offset ULTIMATE.start_f_~k)))) (store .cse2 ULTIMATE.start_f_~l_ref~0.base (store (select .cse2 ULTIMATE.start_f_~l_ref~0.base) ULTIMATE.start_f_~l_ref~0.offset ULTIMATE.start_f_~l))))) (store .cse1 ULTIMATE.start_f_~i~0.base (store (select .cse1 ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset 0))))) (store .cse0 ULTIMATE.start_f_~j~0.base (store (select .cse0 ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset 0))) |#memory_int|) (<= (select (store (store (store |v_#valid_214| |ULTIMATE.start_f_#t~malloc2.base| 1) |ULTIMATE.start_f_#t~malloc3.base| 1) ULTIMATE.start_f_~i~0.base 1) ULTIMATE.start_f_~j~0.base) 0)) [2020-07-29 01:38:14,495 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))) [2020-07-29 01:38:14,544 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-07-29 01:38:14,545 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:38:14,553 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:38:14,554 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:38:14,554 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2020-07-29 01:38:18,042 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:38:18,042 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_180|]. (let ((.cse1 (select |v_#memory_int_180| ULTIMATE.start_f_~i~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_f_~i~0.offset))) (and (= 0 (select (select |v_#memory_int_180| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (= 0 .cse0) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= (store |v_#memory_int_180| ULTIMATE.start_f_~i~0.base (store .cse1 ULTIMATE.start_f_~i~0.offset (+ .cse0 1))) |#memory_int|)))) [2020-07-29 01:38:18,043 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))) [2020-07-29 01:38:18,105 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-07-29 01:38:18,108 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:38:18,123 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:38:18,137 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-29 01:38:18,138 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-07-29 01:38:30,207 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:38:30,207 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_181|, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~i~0.offset]. (let ((.cse0 (select |v_#memory_int_181| ULTIMATE.start_f_~i~0.base))) (let ((.cse1 (select .cse0 ULTIMATE.start_f_~i~0.offset))) (and (= 0 (select (select |v_#memory_int_181| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (= (store |v_#memory_int_181| ULTIMATE.start_f_~i~0.base (store .cse0 ULTIMATE.start_f_~i~0.offset (+ .cse1 1))) |#memory_int|) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 .cse1)))) [2020-07-29 01:38:30,207 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~i~0.offset]. (and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (+ (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset) (- 1)))) [2020-07-29 01:38:30,450 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2020-07-29 01:38:30,454 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:38:30,462 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:38:30,469 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-29 01:38:30,469 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-07-29 01:38:30,476 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:38:30,477 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_182|, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~i~0.offset]. (let ((.cse1 (select |v_#memory_int_182| ULTIMATE.start_f_~j~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_f_~j~0.offset))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_182| ULTIMATE.start_f_~j~0.base (store .cse1 ULTIMATE.start_f_~j~0.offset (+ .cse0 1)))) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 2 (select (select |v_#memory_int_182| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset))))) [2020-07-29 01:38:30,477 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~i~0.offset]. (and (= 0 (+ (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset) (- 1))) (= 2 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base))) [2020-07-29 01:38:30,619 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-07-29 01:38:30,621 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:38:30,627 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:38:30,636 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:38:30,636 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-07-29 01:38:30,639 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:38:30,639 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_f_~j~0.base, ULTIMATE.start_f_~j~0.offset, ULTIMATE.start_f_~i~0.base, ULTIMATE.start_f_~i~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset))) (and (<= .cse0 |ULTIMATE.start_f_#t~mem11|) (= 1 .cse0) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 2 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))) [2020-07-29 01:38:30,640 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 1 |ULTIMATE.start_f_#t~mem11|) [2020-07-29 01:38:30,664 INFO L280 TraceCheckUtils]: 0: Hoare triple {2359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2359#true} is VALID [2020-07-29 01:38:30,668 INFO L280 TraceCheckUtils]: 1: Hoare triple {2359#true} havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;f_#in~k, f_#in~l := main_#t~nondet17, main_#t~nondet18;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~mem8, f_#t~post9, f_#t~mem10, f_#t~mem6, f_#t~mem7, f_#t~mem12, f_#t~post13, f_#t~mem14, f_#t~mem11, f_#t~mem15, f_#t~mem16, f_~k, f_~l, f_~k_ref~0.base, f_~k_ref~0.offset, f_~l_ref~0.base, f_~l_ref~0.offset, f_~i~0.base, f_~i~0.offset, f_~j~0.base, f_~j~0.offset;f_~k := f_#in~k;f_~l := f_#in~l;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~k_ref~0.base, f_~k_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~l_ref~0.base, f_~l_ref~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~i~0.base, f_~i~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~j~0.base, f_~j~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call write~int(f_~k, f_~k_ref~0.base, f_~k_ref~0.offset, 4);call write~int(f_~l, f_~l_ref~0.base, f_~l_ref~0.offset, 4);call write~int(0, f_~i~0.base, f_~i~0.offset, 4);call write~int(0, f_~j~0.base, f_~j~0.offset, 4); {2372#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:38:30,669 INFO L280 TraceCheckUtils]: 2: Hoare triple {2372#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} goto; {2372#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:38:30,671 INFO L280 TraceCheckUtils]: 3: Hoare triple {2372#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {2372#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:38:30,672 INFO L280 TraceCheckUtils]: 4: Hoare triple {2372#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {2382#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:38:30,674 INFO L280 TraceCheckUtils]: 5: Hoare triple {2382#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume 0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2);havoc f_#t~mem10; {2382#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:38:30,675 INFO L280 TraceCheckUtils]: 6: Hoare triple {2382#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} call f_#t~mem6 := read~int(f_~i~0.base, f_~i~0.offset, 4);call f_#t~mem7 := read~int(f_~k_ref~0.base, f_~k_ref~0.offset, 4); {2382#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} is VALID [2020-07-29 01:38:30,677 INFO L280 TraceCheckUtils]: 7: Hoare triple {2382#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)) (= 1 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)))} assume !!(f_#t~mem6 < f_#t~mem7);havoc f_#t~mem6;havoc f_#t~mem7;call f_#t~mem8 := read~int(f_~i~0.base, f_~i~0.offset, 4);f_#t~post9 := f_#t~mem8;call write~int(1 + f_#t~post9, f_~i~0.base, f_~i~0.offset, 4);havoc f_#t~mem8;havoc f_#t~post9;call f_#t~mem10 := read~int(f_~i~0.base, f_~i~0.offset, 4); {2392#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))))} is VALID [2020-07-29 01:38:30,679 INFO L280 TraceCheckUtils]: 8: Hoare triple {2392#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))))} assume !(0 != (if f_#t~mem10 < 0 && 0 != f_#t~mem10 % 2 then f_#t~mem10 % 2 - 2 else f_#t~mem10 % 2));havoc f_#t~mem10; {2392#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))))} is VALID [2020-07-29 01:38:30,680 INFO L280 TraceCheckUtils]: 9: Hoare triple {2392#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))))} goto; {2392#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))))} is VALID [2020-07-29 01:38:30,682 INFO L280 TraceCheckUtils]: 10: Hoare triple {2392#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))))} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {2392#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))))} is VALID [2020-07-29 01:38:30,685 INFO L280 TraceCheckUtils]: 11: Hoare triple {2392#(and (= 0 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))))} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {2405#(and (= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))))} is VALID [2020-07-29 01:38:30,686 INFO L280 TraceCheckUtils]: 12: Hoare triple {2405#(and (= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))))} assume 0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2);havoc f_#t~mem14; {2405#(and (= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))))} is VALID [2020-07-29 01:38:30,688 INFO L280 TraceCheckUtils]: 13: Hoare triple {2405#(and (= 1 (select (select |#memory_int| ULTIMATE.start_f_~j~0.base) ULTIMATE.start_f_~j~0.offset)) (exists ((ULTIMATE.start_f_~i~0.offset Int) (ULTIMATE.start_f_~i~0.base Int)) (and (= 2 (select (select |#memory_int| ULTIMATE.start_f_~i~0.base) ULTIMATE.start_f_~i~0.offset)) (not (= ULTIMATE.start_f_~i~0.base ULTIMATE.start_f_~j~0.base)))))} call f_#t~mem11 := read~int(f_~j~0.base, f_~j~0.offset, 4); {2365#(<= 1 |ULTIMATE.start_f_#t~mem11|)} is VALID [2020-07-29 01:38:30,689 INFO L280 TraceCheckUtils]: 14: Hoare triple {2365#(<= 1 |ULTIMATE.start_f_#t~mem11|)} assume !!(f_#t~mem11 < 1);havoc f_#t~mem11;call f_#t~mem12 := read~int(f_~j~0.base, f_~j~0.offset, 4);f_#t~post13 := f_#t~mem12;call write~int(1 + f_#t~post13, f_~j~0.base, f_~j~0.offset, 4);havoc f_#t~mem12;havoc f_#t~post13;call f_#t~mem14 := read~int(f_~i~0.base, f_~i~0.offset, 4); {2360#false} is VALID [2020-07-29 01:38:30,689 INFO L280 TraceCheckUtils]: 15: Hoare triple {2360#false} assume !(0 != (if f_#t~mem14 < 0 && 0 != f_#t~mem14 % 2 then f_#t~mem14 % 2 - 2 else f_#t~mem14 % 2));havoc f_#t~mem14; {2360#false} is VALID [2020-07-29 01:38:30,689 INFO L280 TraceCheckUtils]: 16: Hoare triple {2360#false} goto; {2360#false} is VALID [2020-07-29 01:38:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:30,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:38:30,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-07-29 01:38:30,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421844505] [2020-07-29 01:38:30,693 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:38:30,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:30,693 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 7 times [2020-07-29 01:38:30,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:30,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872439969] [2020-07-29 01:38:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:30,702 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:30,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:30,707 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:30,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:38:30,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:38:30,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:38:30,883 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. cyclomatic complexity: 12 Second operand 11 states. [2020-07-29 01:38:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:31,596 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2020-07-29 01:38:31,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:38:31,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:38:31,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:31,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 70 transitions. [2020-07-29 01:38:31,685 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:38:31,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 0 states and 0 transitions. [2020-07-29 01:38:31,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:38:31,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:38:31,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:38:31,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:31,686 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:38:31,686 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:38:31,686 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:38:31,686 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 01:38:31,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:38:31,686 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:38:31,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:38:31,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:38:31 BoogieIcfgContainer [2020-07-29 01:38:31,693 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:38:31,693 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:38:31,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:38:31,694 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:38:31,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:16" (3/4) ... [2020-07-29 01:38:31,698 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:38:31,698 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:38:31,699 INFO L168 Benchmark]: Toolchain (without parser) took 76317.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 388.0 MB). Free memory was 960.2 MB in the beginning and 737.4 MB in the end (delta: 222.8 MB). Peak memory consumption was 610.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:31,700 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:38:31,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 634.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.1 MB). Free memory was 954.9 MB in the beginning and 1.0 GB in the end (delta: -94.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:31,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:38:31,701 INFO L168 Benchmark]: Boogie Preprocessor took 39.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:31,701 INFO L168 Benchmark]: RCFGBuilder took 483.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:31,702 INFO L168 Benchmark]: BuchiAutomizer took 75059.95 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 310.9 MB). Free memory was 1.0 GB in the beginning and 737.4 MB in the end (delta: 278.6 MB). Peak memory consumption was 589.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:31,702 INFO L168 Benchmark]: Witness Printer took 4.47 ms. Allocated memory is still 1.4 GB. Free memory is still 737.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:38:31,704 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 634.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.1 MB). Free memory was 954.9 MB in the beginning and 1.0 GB in the end (delta: -94.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 483.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 75059.95 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 310.9 MB). Free memory was 1.0 GB in the beginning and 737.4 MB in the end (delta: 278.6 MB). Peak memory consumption was 589.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.47 ms. Allocated memory is still 1.4 GB. Free memory is still 737.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (6 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[k_ref][k_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[k_ref][k_ref] and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 75.0s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 56.8s. Construction of modules took 0.6s. Büchi inclusion checks took 17.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 19 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 7. Nontrivial modules had stage [2, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 98 SDtfs, 130 SDslu, 224 SDs, 0 SdLazy, 271 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital878 mio100 ax103 hnf99 lsp94 ukn41 mio100 lsp33 div109 bol100 ite100 ukn100 eq168 hnf87 smp91 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...