./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-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/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-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 e9d8db831e66fcf4f47c300fcbd3a74f1185238a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:32:41,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:32:41,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:32:41,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:32:41,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:32:41,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:32:41,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:32:41,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:32:41,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:32:41,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:32:41,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:32:41,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:32:41,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:32:41,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:32:41,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:32:41,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:32:41,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:32:41,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:32:41,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:32:41,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:32:41,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:32:41,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:32:41,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:32:41,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:32:41,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:32:41,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:32:41,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:32:41,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:32:41,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:32:41,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:32:41,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:32:41,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:32:41,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:32:41,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:32:41,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:32:41,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:32:41,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:32:41,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:32:41,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:32:41,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:32:41,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:32:41,782 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:32:41,816 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:32:41,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:32:41,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:32:41,821 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:32:41,821 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:32:41,822 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:32:41,822 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:32:41,822 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:32:41,822 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:32:41,823 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:32:41,824 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:32:41,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:32:41,824 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:32:41,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:32:41,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:32:41,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:32:41,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:32:41,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:32:41,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:32:41,827 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:32:41,827 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:32:41,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:32:41,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:32:41,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:32:41,828 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:32:41,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:32:41,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:32:41,829 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:32:41,829 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:32:41,830 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:32:41,831 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 -> e9d8db831e66fcf4f47c300fcbd3a74f1185238a [2020-07-29 01:32:42,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:32:42,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:32:42,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:32:42,196 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:32:42,197 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:32:42,198 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2020-07-29 01:32:42,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f99a62f4b/8c5cbf00e7ed4714877ae0e60342e7a6/FLAG3c0e8b32c [2020-07-29 01:32:42,913 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:32:42,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2020-07-29 01:32:42,942 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f99a62f4b/8c5cbf00e7ed4714877ae0e60342e7a6/FLAG3c0e8b32c [2020-07-29 01:32:43,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f99a62f4b/8c5cbf00e7ed4714877ae0e60342e7a6 [2020-07-29 01:32:43,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:32:43,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:32:43,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:32:43,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:32:43,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:32:43,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:32:43" (1/1) ... [2020-07-29 01:32:43,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53104d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:43, skipping insertion in model container [2020-07-29 01:32:43,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:32:43" (1/1) ... [2020-07-29 01:32:43,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:32:43,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:32:43,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:32:43,659 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:32:43,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:32:43,780 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:32:43,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:43 WrapperNode [2020-07-29 01:32:43,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:32:43,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:32:43,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:32:43,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:32:43,792 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:32:43" (1/1) ... [2020-07-29 01:32:43,811 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:32:43" (1/1) ... [2020-07-29 01:32:43,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:32:43,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:32:43,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:32:43,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:32:43,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:43" (1/1) ... [2020-07-29 01:32:43,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:43" (1/1) ... [2020-07-29 01:32:43,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:43" (1/1) ... [2020-07-29 01:32:43,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:43" (1/1) ... [2020-07-29 01:32:43,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:43" (1/1) ... [2020-07-29 01:32:43,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:43" (1/1) ... [2020-07-29 01:32:43,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:43" (1/1) ... [2020-07-29 01:32:43,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:32:43,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:32:43,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:32:43,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:32:43,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:43" (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:32:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:32:43,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:32:43,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:32:43,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:32:43,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:32:43,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:32:44,302 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:32:44,302 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:32:44,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:32:44 BoogieIcfgContainer [2020-07-29 01:32:44,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:32:44,306 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:32:44,307 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:32:44,310 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:32:44,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:44,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:32:43" (1/3) ... [2020-07-29 01:32:44,313 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43c1f098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:32:44, skipping insertion in model container [2020-07-29 01:32:44,313 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:44,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:43" (2/3) ... [2020-07-29 01:32:44,314 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43c1f098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:32:44, skipping insertion in model container [2020-07-29 01:32:44,314 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:44,315 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:32:44" (3/3) ... [2020-07-29 01:32:44,317 INFO L371 chiAutomizerObserver]: Analyzing ICFG KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2020-07-29 01:32:44,373 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:32:44,373 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:32:44,373 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:32:44,373 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:32:44,373 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:32:44,373 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:32:44,374 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:32:44,374 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:32:44,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:32:44,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:32:44,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:44,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:44,417 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:32:44,417 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:32:44,418 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:32:44,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:32:44,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:32:44,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:44,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:44,422 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:32:44,422 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:32:44,429 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 10#L558-2true [2020-07-29 01:32:44,430 INFO L796 eck$LassoCheckResult]: Loop: 10#L558-2true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 8#L552-1true assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 4#L553true assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 9#L553-2true call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 5#L558true assume 0 != main_#t~mem10;havoc main_#t~mem10;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 10#L558-2true [2020-07-29 01:32:44,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:44,435 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:32:44,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:44,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731371003] [2020-07-29 01:32:44,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:44,560 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:44,580 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:44,610 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:44,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:44,611 INFO L82 PathProgramCache]: Analyzing trace with hash 35468238, now seen corresponding path program 1 times [2020-07-29 01:32:44,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:44,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075416743] [2020-07-29 01:32:44,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:44,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:44,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:44,673 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:44,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:44,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907724, now seen corresponding path program 1 times [2020-07-29 01:32:44,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:44,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814194762] [2020-07-29 01:32:44,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:44,911 INFO L280 TraceCheckUtils]: 0: Hoare triple {19#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {19#true} is VALID [2020-07-29 01:32:44,915 INFO L280 TraceCheckUtils]: 1: Hoare triple {19#true} havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); {21#(and (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x~0.base (store (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2))) ULTIMATE.start_main_~debug~0.base) ULTIMATE.start_main_~debug~0.offset)) (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~debug~0.base)))} is VALID [2020-07-29 01:32:44,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {21#(and (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x~0.base (store (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2))) ULTIMATE.start_main_~debug~0.base) ULTIMATE.start_main_~debug~0.offset)) (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~debug~0.base)))} call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); {21#(and (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x~0.base (store (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2))) ULTIMATE.start_main_~debug~0.base) ULTIMATE.start_main_~debug~0.offset)) (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~debug~0.base)))} is VALID [2020-07-29 01:32:44,932 INFO L280 TraceCheckUtils]: 3: Hoare triple {21#(and (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x~0.base (store (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2))) ULTIMATE.start_main_~debug~0.base) ULTIMATE.start_main_~debug~0.offset)) (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~debug~0.base)))} assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); {21#(and (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x~0.base (store (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2))) ULTIMATE.start_main_~debug~0.base) ULTIMATE.start_main_~debug~0.offset)) (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~debug~0.base)))} is VALID [2020-07-29 01:32:44,939 INFO L280 TraceCheckUtils]: 4: Hoare triple {21#(and (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~x~0.base (store (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2))) ULTIMATE.start_main_~debug~0.base) ULTIMATE.start_main_~debug~0.offset)) (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~debug~0.base)))} assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; {22#(= 0 (select (select |#memory_int| ULTIMATE.start_main_~debug~0.base) ULTIMATE.start_main_~debug~0.offset))} is VALID [2020-07-29 01:32:44,945 INFO L280 TraceCheckUtils]: 5: Hoare triple {22#(= 0 (select (select |#memory_int| ULTIMATE.start_main_~debug~0.base) ULTIMATE.start_main_~debug~0.offset))} call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); {23#(= 0 |ULTIMATE.start_main_#t~mem10|)} is VALID [2020-07-29 01:32:44,947 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#(= 0 |ULTIMATE.start_main_#t~mem10|)} assume 0 != main_#t~mem10;havoc main_#t~mem10;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); {20#false} is VALID [2020-07-29 01:32:44,950 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:32:44,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814194762] [2020-07-29 01:32:44,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:32:44,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:32:44,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919667995] [2020-07-29 01:32:45,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:32:45,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:32:45,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:32:45,207 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 5 states. [2020-07-29 01:32:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:45,347 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 01:32:45,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:32:45,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:32:45,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:45,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-07-29 01:32:45,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:32:45,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2020-07-29 01:32:45,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:32:45,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:32:45,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2020-07-29 01:32:45,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:32:45,381 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:32:45,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2020-07-29 01:32:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-29 01:32:45,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:45,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 8 transitions. Second operand 7 states. [2020-07-29 01:32:45,414 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 8 transitions. Second operand 7 states. [2020-07-29 01:32:45,416 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2020-07-29 01:32:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:45,418 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-29 01:32:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:32:45,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:45,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:45,420 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states and 8 transitions. [2020-07-29 01:32:45,420 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states and 8 transitions. [2020-07-29 01:32:45,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:45,421 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-29 01:32:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:32:45,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:45,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:45,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:45,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:32:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2020-07-29 01:32:45,429 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:32:45,430 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:32:45,430 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:32:45,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:32:45,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:32:45,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:45,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:45,431 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:32:45,432 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:32:45,432 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 37#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 38#L558-2 [2020-07-29 01:32:45,432 INFO L796 eck$LassoCheckResult]: Loop: 38#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 43#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 39#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 40#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 41#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 38#L558-2 [2020-07-29 01:32:45,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:45,433 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-07-29 01:32:45,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:45,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103982902] [2020-07-29 01:32:45,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:45,454 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:45,466 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:45,470 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:45,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:45,471 INFO L82 PathProgramCache]: Analyzing trace with hash 35468240, now seen corresponding path program 1 times [2020-07-29 01:32:45,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:45,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272236156] [2020-07-29 01:32:45,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:45,487 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:45,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:45,504 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:45,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:45,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907726, now seen corresponding path program 1 times [2020-07-29 01:32:45,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:45,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967080726] [2020-07-29 01:32:45,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:45,545 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:45,567 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:45,574 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:45,942 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-07-29 01:32:46,095 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:32:46,096 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:32:46,096 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:32:46,097 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:32:46,097 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:32:46,097 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:46,097 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:32:46,098 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:32:46,098 INFO L133 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i_Iteration2_Lasso [2020-07-29 01:32:46,098 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:32:46,098 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:32:46,158 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:32:46,170 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:32:46,176 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:32:46,182 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:32:46,189 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:32:46,428 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2020-07-29 01:32:46,540 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2020-07-29 01:32:46,549 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:32:46,549 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:32:46,554 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:32:46,559 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:32:46,565 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:32:46,570 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:32:46,575 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:32:46,580 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:32:46,585 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:32:46,590 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:32:46,595 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:32:47,377 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:32:47,382 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:32:47,393 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:32:47,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:47,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:47,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:47,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:47,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:47,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:47,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:47,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:47,441 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:32:47,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:47,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:47,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:47,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:47,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:47,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:47,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:47,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:47,473 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:32:47,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:47,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:47,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:47,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:47,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:47,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:47,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:47,477 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:32:47,500 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:32:47,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:47,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:47,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:47,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:47,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:47,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:47,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:47,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:47,538 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:32:47,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:47,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:47,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:47,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:47,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:47,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:47,578 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:32:47,606 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:32:47,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:47,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:47,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:47,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:47,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:47,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:47,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:47,675 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:32:47,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:47,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:47,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:47,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:47,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:47,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:47,688 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:32:47,716 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:32:47,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:47,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:47,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:47,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:47,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:47,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:47,724 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:32:47,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:47,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:47,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:47,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:47,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:47,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:47,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:47,766 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:32:47,790 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:32:47,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:47,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:47,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:47,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:47,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:47,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:47,801 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:32:47,827 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:32:47,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:47,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:47,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:47,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:47,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:47,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:47,848 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:32:47,921 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:32:47,921 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. 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:32:47,936 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:47,945 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:32:47,945 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:32:47,946 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 255 Supporting invariants [] [2020-07-29 01:32:48,031 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-07-29 01:32:48,036 INFO L393 LassoCheck]: Loop: "call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);" "assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);" "assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;" "call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4);" "assume !(0 != main_#t~mem10);havoc main_#t~mem10;" [2020-07-29 01:32:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:48,051 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:32:48,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:48,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:32:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:48,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:48,100 INFO L280 TraceCheckUtils]: 0: Hoare triple {67#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {67#unseeded} is VALID [2020-07-29 01:32:48,100 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#unseeded} havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); {67#unseeded} is VALID [2020-07-29 01:32:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:48,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:32:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:48,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:48,248 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 34 treesize of output 18 [2020-07-29 01:32:48,255 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:32:48,262 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:32:48,262 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:32:48,263 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:17 [2020-07-29 01:32:50,591 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:32:50,592 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|]. (let ((.cse1 (select |v_#memory_int_42| ULTIMATE.start_main_~x~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_main_~x~0.offset))) (and (<= .cse0 254) (<= 255 (+ oldRank0 .cse0)) (= |#memory_int| (store |v_#memory_int_42| ULTIMATE.start_main_~x~0.base (store .cse1 ULTIMATE.start_main_~x~0.offset (+ .cse0 2))))))) [2020-07-29 01:32:50,592 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) (and (<= 257 (+ oldRank0 .cse0)) (<= .cse0 256))) [2020-07-29 01:32:50,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {70#(>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) 255))} call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); {143#(and (<= 255 (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) (<= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem5|))} is VALID [2020-07-29 01:32:50,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {143#(and (<= 255 (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) (<= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem5|))} assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); {147#(and (<= 255 (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) (<= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 254))} is VALID [2020-07-29 01:32:50,635 INFO L280 TraceCheckUtils]: 2: Hoare triple {147#(and (<= 255 (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) (<= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 254))} assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; {151#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 256) (<= 257 (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))))} is VALID [2020-07-29 01:32:50,636 INFO L280 TraceCheckUtils]: 3: Hoare triple {151#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 256) (<= 257 (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))))} call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); {151#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 256) (<= 257 (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))))} is VALID [2020-07-29 01:32:50,641 INFO L280 TraceCheckUtils]: 4: Hoare triple {151#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 256) (<= 257 (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))))} assume !(0 != main_#t~mem10);havoc main_#t~mem10; {135#(or unseeded (and (> oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) 255)) (>= oldRank0 0)))} is VALID [2020-07-29 01:32:50,641 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:32:50,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:32:50,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:50,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:32:50,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,662 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:32:50,662 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 5 states. [2020-07-29 01:32:50,772 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 18 states and 21 transitions. Complement of second has 9 states. [2020-07-29 01:32:50,772 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:32:50,772 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:50,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2020-07-29 01:32:50,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:50,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:50,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:32:50,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:32:50,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:50,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:50,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2020-07-29 01:32:50,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:32:50,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:50,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:50,778 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2020-07-29 01:32:50,779 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:32:50,780 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:32:50,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:32:50,781 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:32:50,781 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 21 transitions. cyclomatic complexity: 5 [2020-07-29 01:32:50,783 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:32:50,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:32:50,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:32:50,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:32:50,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:32:50,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:32:50,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:32:50,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:50,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:50,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:50,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:32:50,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:32:50,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:32:50,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:32:50,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:32:50,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:32:50,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:50,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:50,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:50,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:32:50,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:32:50,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:32:50,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:32:50,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:32:50,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:32:50,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:50,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:50,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:50,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:32:50,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:32:50,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:32:50,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:32:50,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:32:50,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:32:50,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:32:50,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:32:50,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:32:50,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:50,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:50,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:50,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:32:50,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:32:50,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:32:50,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:32:50,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:32:50,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:32:50,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:32:50,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:32:50,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:32:50,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:32:50,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:32:50,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:32:50,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,807 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:32:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2020-07-29 01:32:50,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:32:50,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:32:50,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 10 letters. [2020-07-29 01:32:50,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:50,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. cyclomatic complexity: 5 [2020-07-29 01:32:50,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:32:50,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2020-07-29 01:32:50,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:32:50,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:32:50,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2020-07-29 01:32:50,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:32:50,816 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-07-29 01:32:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2020-07-29 01:32:50,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-29 01:32:50,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:50,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 21 transitions. Second operand 17 states. [2020-07-29 01:32:50,818 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 21 transitions. Second operand 17 states. [2020-07-29 01:32:50,818 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 17 states. [2020-07-29 01:32:50,819 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:50,822 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-29 01:32:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-29 01:32:50,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:50,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:50,824 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states and 21 transitions. [2020-07-29 01:32:50,824 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states and 21 transitions. [2020-07-29 01:32:50,824 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:50,827 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2020-07-29 01:32:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-07-29 01:32:50,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:50,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:50,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:50,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:32:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-07-29 01:32:50,830 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 01:32:50,830 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 01:32:50,830 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:32:50,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-07-29 01:32:50,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:32:50,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:50,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:50,832 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:32:50,833 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:32:50,833 INFO L794 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 189#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 190#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 200#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 191#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7; 192#L553-2 [2020-07-29 01:32:50,833 INFO L796 eck$LassoCheckResult]: Loop: 192#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 202#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 205#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 204#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 203#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 192#L553-2 [2020-07-29 01:32:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2020-07-29 01:32:50,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:50,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426474717] [2020-07-29 01:32:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:50,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:50,864 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:50,868 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:50,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:50,869 INFO L82 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 2 times [2020-07-29 01:32:50,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:50,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975705312] [2020-07-29 01:32:50,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:50,880 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:50,888 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:50,890 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:50,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:50,891 INFO L82 PathProgramCache]: Analyzing trace with hash 705693312, now seen corresponding path program 1 times [2020-07-29 01:32:50,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:50,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037458610] [2020-07-29 01:32:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:50,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:50,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:50,947 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:51,394 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2020-07-29 01:32:51,440 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:32:51,445 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-29 01:32:51,456 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:32:54,269 WARN L193 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 111 DAG size of output: 103 [2020-07-29 01:32:54,289 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:32:54,290 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:32:54,290 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:32:54,290 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:32:54,290 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:32:54,290 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:54,290 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:32:54,290 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:32:54,291 INFO L133 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i_Iteration3_Lasso [2020-07-29 01:32:54,291 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:32:54,291 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:32:54,331 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:32:54,341 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:32:54,347 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:32:54,353 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:32:54,358 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:32:54,363 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:32:54,369 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:32:54,374 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:32:54,380 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:32:54,589 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2020-07-29 01:32:55,289 WARN L193 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2020-07-29 01:32:55,397 WARN L257 bleTransFormulaUtils]: 3 quantified variables [2020-07-29 01:32:55,398 WARN L257 bleTransFormulaUtils]: 3 quantified variables [2020-07-29 01:32:55,433 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:32:55,447 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:32:55,451 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:32:55,454 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:32:55,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:56,149 WARN L193 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 50 [2020-07-29 01:32:56,750 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2020-07-29 01:32:57,009 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:32:57,009 INFO L489 LassoAnalysis]: Using template 'affine'. 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:32:57,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:32:57,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:57,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:57,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:57,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:57,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:57,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:57,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:57,028 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) [2020-07-29 01:32:57,066 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:32:57,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:57,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:57,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:57,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:57,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:57,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:57,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:57,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:57,096 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:32:57,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:57,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:57,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:57,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:57,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:57,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:57,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:57,100 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:32:57,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:57,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:57,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:57,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:57,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:57,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:57,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:57,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:57,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:57,150 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:32:57,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:57,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:57,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:57,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:57,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:57,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:57,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:57,155 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:32:57,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:57,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:57,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:57,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:57,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:57,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:57,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:57,198 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:32:57,222 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:32:57,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:57,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:57,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:57,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:57,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:57,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:57,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:57,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 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:32:57,256 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:32:57,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:57,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:57,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:57,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:57,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:57,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:57,264 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:32:57,288 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:32:57,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:57,290 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2020-07-29 01:32:57,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:57,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:57,299 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2020-07-29 01:32:57,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:57,314 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:32:57,327 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:32:57,327 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 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:57,333 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:32:57,335 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:32:57,335 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:32:57,336 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 + 255 Supporting invariants [] [2020-07-29 01:32:57,416 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-07-29 01:32:57,420 INFO L393 LassoCheck]: Loop: "call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4);" "assume !(0 != main_#t~mem10);havoc main_#t~mem10;" "call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);" "assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);" "assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9;" [2020-07-29 01:32:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:57,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:32:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:57,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:32:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:57,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:57,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {289#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {289#unseeded} is VALID [2020-07-29 01:32:57,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {289#unseeded} havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); {289#unseeded} is VALID [2020-07-29 01:32:57,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {289#unseeded} call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); {289#unseeded} is VALID [2020-07-29 01:32:57,481 INFO L280 TraceCheckUtils]: 3: Hoare triple {289#unseeded} assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); {289#unseeded} is VALID [2020-07-29 01:32:57,482 INFO L280 TraceCheckUtils]: 4: Hoare triple {289#unseeded} assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7; {289#unseeded} is VALID [2020-07-29 01:32:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:57,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:32:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:57,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:57,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {292#(>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) 255))} call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); {292#(>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) 255))} is VALID [2020-07-29 01:32:57,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {292#(>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) 255))} assume !(0 != main_#t~mem10);havoc main_#t~mem10; {292#(>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) 255))} is VALID [2020-07-29 01:32:57,620 INFO L280 TraceCheckUtils]: 2: Hoare triple {292#(>= oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) 255))} call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); {380#(and (<= 255 (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) (<= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem5|))} is VALID [2020-07-29 01:32:57,621 INFO L280 TraceCheckUtils]: 3: Hoare triple {380#(and (<= 255 (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) (<= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem5|))} assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); {384#(and (<= 255 (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) (<= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 254))} is VALID [2020-07-29 01:32:57,622 INFO L280 TraceCheckUtils]: 4: Hoare triple {384#(and (<= 255 (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset))) (<= (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 254))} assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; {357#(or unseeded (and (> oldRank0 (+ (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)) 255)) (>= oldRank0 0)))} is VALID [2020-07-29 01:32:57,623 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:32:57,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:32:57,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:57,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:57,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,636 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:32:57,636 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-07-29 01:32:57,722 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 27 states and 32 transitions. Complement of second has 9 states. [2020-07-29 01:32:57,722 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:32:57,723 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:57,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2020-07-29 01:32:57,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:57,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:57,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:32:57,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:32:57,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:57,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:57,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2020-07-29 01:32:57,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:32:57,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:57,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:57,731 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2020-07-29 01:32:57,732 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:32:57,732 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:32:57,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:32:57,734 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:32:57,735 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 32 transitions. cyclomatic complexity: 8 [2020-07-29 01:32:57,736 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:32:57,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:57,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:57,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:57,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:32:57,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:32:57,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:32:57,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:32:57,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:32:57,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:32:57,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:32:57,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:32:57,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:32:57,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:32:57,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:32:57,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:32:57,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:57,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:57,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:57,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:57,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:57,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:57,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:32:57,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:32:57,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:32:57,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:32:57,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:32:57,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:32:57,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:32:57,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:32:57,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:32:57,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:32:57,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:32:57,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:32:57,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:32:57,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:32:57,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:32:57,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:32:57,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:32:57,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:32:57,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 5 letters. [2020-07-29 01:32:57,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 5 letters. [2020-07-29 01:32:57,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 5 letters. [2020-07-29 01:32:57,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 5 letters. [2020-07-29 01:32:57,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 5 letters. [2020-07-29 01:32:57,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 5 letters. [2020-07-29 01:32:57,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 5 letters. [2020-07-29 01:32:57,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 5 letters. [2020-07-29 01:32:57,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 5 letters. [2020-07-29 01:32:57,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 5 letters. [2020-07-29 01:32:57,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 5 letters. [2020-07-29 01:32:57,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 5 letters. [2020-07-29 01:32:57,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,756 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:32:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-07-29 01:32:57,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:57,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:32:57,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:32:57,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:57,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. cyclomatic complexity: 8 [2020-07-29 01:32:57,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:32:57,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2020-07-29 01:32:57,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:32:57,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:32:57,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2020-07-29 01:32:57,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:32:57,764 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2020-07-29 01:32:57,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2020-07-29 01:32:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-29 01:32:57,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:57,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 32 transitions. Second operand 27 states. [2020-07-29 01:32:57,767 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 32 transitions. Second operand 27 states. [2020-07-29 01:32:57,767 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 27 states. [2020-07-29 01:32:57,768 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:57,770 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-29 01:32:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-29 01:32:57,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:57,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:57,771 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states and 32 transitions. [2020-07-29 01:32:57,771 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states and 32 transitions. [2020-07-29 01:32:57,772 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:57,774 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-29 01:32:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-29 01:32:57,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:57,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:57,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:57,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:32:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2020-07-29 01:32:57,777 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2020-07-29 01:32:57,777 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2020-07-29 01:32:57,777 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:32:57,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2020-07-29 01:32:57,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:32:57,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:57,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:57,779 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2020-07-29 01:32:57,779 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:32:57,780 INFO L794 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 428#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 429#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 446#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 430#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7; 431#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 445#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 449#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 448#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 447#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7; 442#L553-2 [2020-07-29 01:32:57,780 INFO L796 eck$LassoCheckResult]: Loop: 442#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 434#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 435#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 439#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 440#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 442#L553-2 [2020-07-29 01:32:57,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:57,780 INFO L82 PathProgramCache]: Analyzing trace with hash 705693310, now seen corresponding path program 1 times [2020-07-29 01:32:57,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:57,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746108068] [2020-07-29 01:32:57,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:58,012 INFO L280 TraceCheckUtils]: 0: Hoare triple {560#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {560#true} is VALID [2020-07-29 01:32:58,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {560#true} havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); {560#true} is VALID [2020-07-29 01:32:58,013 INFO L280 TraceCheckUtils]: 2: Hoare triple {560#true} call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); {560#true} is VALID [2020-07-29 01:32:58,014 INFO L280 TraceCheckUtils]: 3: Hoare triple {560#true} assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); {562#(or (<= |ULTIMATE.start_main_#t~mem6| (* 2 (div |ULTIMATE.start_main_#t~mem6| 2))) (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem6| 1) 2)) (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem6|)))} is VALID [2020-07-29 01:32:58,016 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#(or (<= |ULTIMATE.start_main_#t~mem6| (* 2 (div |ULTIMATE.start_main_#t~mem6| 2))) (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem6| 1) 2)) (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_#t~mem6|)))} assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7; {563#(<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 2)) (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2))} is VALID [2020-07-29 01:32:58,017 INFO L280 TraceCheckUtils]: 5: Hoare triple {563#(<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 2)) (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2))} call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); {563#(<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 2)) (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2))} is VALID [2020-07-29 01:32:58,018 INFO L280 TraceCheckUtils]: 6: Hoare triple {563#(<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 2)) (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2))} assume !(0 != main_#t~mem10);havoc main_#t~mem10; {563#(<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 2)) (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2))} is VALID [2020-07-29 01:32:58,018 INFO L280 TraceCheckUtils]: 7: Hoare triple {563#(<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 2)) (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2))} call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); {563#(<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 2)) (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2))} is VALID [2020-07-29 01:32:58,019 INFO L280 TraceCheckUtils]: 8: Hoare triple {563#(<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 3) 2)) (+ (select (select |#memory_int| ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset) 2))} assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); {564#(<= |ULTIMATE.start_main_#t~mem6| (* 2 (div |ULTIMATE.start_main_#t~mem6| 2)))} is VALID [2020-07-29 01:32:58,020 INFO L280 TraceCheckUtils]: 9: Hoare triple {564#(<= |ULTIMATE.start_main_#t~mem6| (* 2 (div |ULTIMATE.start_main_#t~mem6| 2)))} assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7; {561#false} is VALID [2020-07-29 01:32:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:58,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746108068] [2020-07-29 01:32:58,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:32:58,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:32:58,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368555299] [2020-07-29 01:32:58,022 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:32:58,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:58,022 INFO L82 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 3 times [2020-07-29 01:32:58,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:58,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790172795] [2020-07-29 01:32:58,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:58,031 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:58,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:58,040 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:58,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:32:58,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:32:58,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:32:58,198 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-07-29 01:32:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:58,303 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-07-29 01:32:58,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:32:58,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:32:58,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:58,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2020-07-29 01:32:58,330 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:58,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2020-07-29 01:32:58,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:32:58,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:32:58,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:32:58,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:32:58,331 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:32:58,331 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:32:58,331 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:32:58,331 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:32:58,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:32:58,331 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:32:58,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:32:58,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:32:58 BoogieIcfgContainer [2020-07-29 01:32:58,337 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:32:58,338 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:32:58,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:32:58,338 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:32:58,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:32:44" (3/4) ... [2020-07-29 01:32:58,341 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:32:58,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:32:58,343 INFO L168 Benchmark]: Toolchain (without parser) took 15197.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 320.3 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -250.8 MB). Peak memory consumption was 69.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:58,343 INFO L168 Benchmark]: CDTParser took 0.27 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:32:58,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:58,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:32:58,345 INFO L168 Benchmark]: Boogie Preprocessor took 24.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:58,346 INFO L168 Benchmark]: RCFGBuilder took 446.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:58,347 INFO L168 Benchmark]: BuchiAutomizer took 14031.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.7 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:58,348 INFO L168 Benchmark]: Witness Printer took 3.59 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:58,351 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.27 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 633.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 446.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14031.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.7 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.59 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 5 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 10.3s. Construction of modules took 0.1s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 25 SDtfs, 24 SDslu, 18 SDs, 0 SdLazy, 62 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital490 mio100 ax106 hnf99 lsp378 ukn39 mio100 lsp121 div112 bol100 ite100 ukn100 eq166 hnf86 smp60 dnf146 smp87 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 50ms VariablesStem: 10 VariablesLoop: 4 DisjunctsStem: 3 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 10 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...