./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c8f64168-853d-451b-9327-ef1725a87181/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c8f64168-853d-451b-9327-ef1725a87181/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c8f64168-853d-451b-9327-ef1725a87181/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c8f64168-853d-451b-9327-ef1725a87181/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c8f64168-853d-451b-9327-ef1725a87181/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c8f64168-853d-451b-9327-ef1725a87181/bin/uautomizer --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.24-cad4683 [2019-10-22 08:58:51,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:51,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:51,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:51,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:51,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:51,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:51,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:51,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:51,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:51,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:51,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:51,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:51,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:51,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:51,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:51,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:51,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:51,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:51,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:51,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:51,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:51,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:51,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:51,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:51,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:51,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:51,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:51,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:51,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:51,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:51,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:51,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:51,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:51,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:51,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:51,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:51,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:51,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:51,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:51,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:51,654 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c8f64168-853d-451b-9327-ef1725a87181/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:58:51,669 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:51,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:51,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:51,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:51,680 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:51,680 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:51,681 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:51,681 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:51,681 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:51,681 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:51,681 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:51,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:51,681 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:51,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:51,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:51,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:51,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:51,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:51,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:51,683 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:51,683 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:51,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:51,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:51,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:51,683 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:51,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:51,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:51,684 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:51,685 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:51,685 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_c8f64168-853d-451b-9327-ef1725a87181/bin/uautomizer 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 [2019-10-22 08:58:51,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:51,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:51,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:51,733 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:51,733 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:51,734 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c8f64168-853d-451b-9327-ef1725a87181/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2019-10-22 08:58:51,784 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8f64168-853d-451b-9327-ef1725a87181/bin/uautomizer/data/081c3b1f8/d928e0edf75c42d38464b32711f32392/FLAG5f251cb33 [2019-10-22 08:58:52,226 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:52,227 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c8f64168-853d-451b-9327-ef1725a87181/sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2019-10-22 08:58:52,237 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8f64168-853d-451b-9327-ef1725a87181/bin/uautomizer/data/081c3b1f8/d928e0edf75c42d38464b32711f32392/FLAG5f251cb33 [2019-10-22 08:58:52,250 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c8f64168-853d-451b-9327-ef1725a87181/bin/uautomizer/data/081c3b1f8/d928e0edf75c42d38464b32711f32392 [2019-10-22 08:58:52,253 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:52,254 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:52,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:52,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:52,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:52,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ec7d761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52, skipping insertion in model container [2019-10-22 08:58:52,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,269 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:52,300 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:52,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:52,668 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:52,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:52,739 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:52,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52 WrapperNode [2019-10-22 08:58:52,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:52,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:52,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:52,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:52,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,765 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:52,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:52,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:52,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:52,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:52,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:52,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:52,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:52,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8f64168-853d-451b-9327-ef1725a87181/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:52,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:58:52,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:58:52,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:58:52,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:58:52,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:52,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:53,100 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:53,101 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 08:58:53,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:53 BoogieIcfgContainer [2019-10-22 08:58:53,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:53,103 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:53,103 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:53,106 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:53,107 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:53,107 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:52" (1/3) ... [2019-10-22 08:58:53,108 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b29cb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:53, skipping insertion in model container [2019-10-22 08:58:53,108 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:53,108 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (2/3) ... [2019-10-22 08:58:53,109 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b29cb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:53, skipping insertion in model container [2019-10-22 08:58:53,109 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:53,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:53" (3/3) ... [2019-10-22 08:58:53,110 INFO L371 chiAutomizerObserver]: Analyzing ICFG KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2019-10-22 08:58:53,156 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:53,156 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:53,157 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:53,157 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:53,157 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:53,157 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:53,157 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:53,158 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:53,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 08:58:53,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:53,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:53,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:53,208 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:53,208 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:53,208 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:53,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 08:58:53,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:53,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:53,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:53,209 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:53,209 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:53,229 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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 [2019-10-22 08:58:53,230 INFO L793 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 [2019-10-22 08:58:53,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,254 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:58:53,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:53,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720304035] [2019-10-22 08:58:53,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,377 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:53,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,378 INFO L82 PathProgramCache]: Analyzing trace with hash 35468238, now seen corresponding path program 1 times [2019-10-22 08:58:53,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:53,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834433175] [2019-10-22 08:58:53,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,415 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:53,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907724, now seen corresponding path program 1 times [2019-10-22 08:58:53,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:53,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309203866] [2019-10-22 08:58:53,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:53,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309203866] [2019-10-22 08:58:53,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:53,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:53,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404057194] [2019-10-22 08:58:53,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:53,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:53,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:53,714 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-10-22 08:58:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:53,755 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-10-22 08:58:53,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:53,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-10-22 08:58:53,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:53,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2019-10-22 08:58:53,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:58:53,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:58:53,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-10-22 08:58:53,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:53,764 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 08:58:53,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-10-22 08:58:53,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-10-22 08:58:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:58:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-10-22 08:58:53,798 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 08:58:53,799 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 08:58:53,799 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:53,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-10-22 08:58:53,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:53,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:53,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:53,800 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:53,800 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:53,800 INFO L791 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#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); 37#L558-2 [2019-10-22 08:58:53,800 INFO L793 eck$LassoCheckResult]: Loop: 37#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 42#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); 38#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; 39#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 40#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 37#L558-2 [2019-10-22 08:58:53,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,801 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 08:58:53,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:53,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669008971] [2019-10-22 08:58:53,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,846 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,846 INFO L82 PathProgramCache]: Analyzing trace with hash 35468240, now seen corresponding path program 1 times [2019-10-22 08:58:53,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:53,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258932345] [2019-10-22 08:58:53,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,877 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:53,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907726, now seen corresponding path program 1 times [2019-10-22 08:58:53,879 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:53,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889024207] [2019-10-22 08:58:53,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,928 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:54,223 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-10-22 08:58:54,310 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:54,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:54,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:54,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:54,312 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:54,312 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:54,312 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:54,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:54,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i_Iteration2_Lasso [2019-10-22 08:58:54,312 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:54,313 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:54,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58: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 [2019-10-22 08:58:54,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58: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 [2019-10-22 08:58:54,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,563 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-10-22 08:58:55,154 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:58:55,193 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:55,198 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:55,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,202 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:55,203 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,203 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,205 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:55,205 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:55,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,209 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,209 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:55,209 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,210 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:55,210 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:55,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,212 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:55,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,213 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,213 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:55,213 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:55,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,215 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,215 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:55,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,216 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:55,216 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:55,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,217 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,218 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:55,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,218 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,218 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,218 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:55,219 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:55,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,221 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,221 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,223 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:55,223 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:55,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,227 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,227 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,227 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,227 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,229 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:55,229 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:55,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,233 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,233 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:55,233 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,233 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,233 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,234 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:55,234 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:55,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,236 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,236 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,236 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,236 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,237 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:55,238 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:55,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,242 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,242 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:55,242 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,242 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,243 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:55,243 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:55,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,245 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,245 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,245 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,245 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,246 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:55,247 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:55,249 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,250 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,250 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,252 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:55,252 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:55,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,255 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,255 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:55,256 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,256 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,256 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:55,256 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:55,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,258 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,258 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,258 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,260 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:55,260 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:55,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,264 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,265 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,266 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:55,267 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:55,283 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,284 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,284 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,285 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,286 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:55,286 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:55,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,304 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,304 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,305 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:55,305 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:55,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,312 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,319 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:55,319 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:55,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,348 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,348 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:58:55,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,354 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:58:55,354 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:55,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,377 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,377 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,382 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:55,382 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:55,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:55,389 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,389 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,389 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,390 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,391 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:55,391 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:55,413 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:55,430 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:55,430 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:58:55,432 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:55,433 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:55,434 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:55,435 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 [] [2019-10-22 08:58:55,468 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 08:58:55,476 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:58:55,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:55,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:58:55,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:55,606 INFO L375 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 [2019-10-22 08:58:55,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:55,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:55,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:55,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:17 [2019-10-22 08:58:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:55,641 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 [2019-10-22 08:58:55,641 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-10-22 08:58:55,701 INFO L76 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. [2019-10-22 08:58:55,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:58:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-10-22 08:58:55,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 5 letters. [2019-10-22 08:58:55,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:55,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 7 letters. Loop has 5 letters. [2019-10-22 08:58:55,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:55,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 10 letters. [2019-10-22 08:58:55,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:55,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-10-22 08:58:55,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:55,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2019-10-22 08:58:55,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:58:55,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:58:55,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-10-22 08:58:55,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:55,708 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:58:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-10-22 08:58:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-10-22 08:58:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:58:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-10-22 08:58:55,710 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:58:55,710 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 08:58:55,710 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:55,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-10-22 08:58:55,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:55,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:55,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:55,711 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:55,711 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:55,711 INFO L791 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 155#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); 156#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 166#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); 157#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~mem7;havoc main_#t~post8; 158#L553-2 [2019-10-22 08:58:55,712 INFO L793 eck$LassoCheckResult]: Loop: 158#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 168#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 171#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 170#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); 169#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; 158#L553-2 [2019-10-22 08:58:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,712 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-10-22 08:58:55,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:55,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135703099] [2019-10-22 08:58:55,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,756 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:55,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,757 INFO L82 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 2 times [2019-10-22 08:58:55,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:55,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419275784] [2019-10-22 08:58:55,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,771 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:55,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,771 INFO L82 PathProgramCache]: Analyzing trace with hash 705693312, now seen corresponding path program 1 times [2019-10-22 08:58:55,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:55,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238026765] [2019-10-22 08:58:55,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,797 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:56,156 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-10-22 08:58:56,418 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-10-22 08:58:56,420 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:56,420 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:56,421 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:56,421 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:56,421 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:56,421 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,421 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:56,421 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:56,421 INFO L131 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i_Iteration3_Lasso [2019-10-22 08:58:56,421 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:56,421 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:56,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,589 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-22 08:58:56,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:57,110 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:57,111 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:57,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:57,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,112 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,112 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:57,113 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:57,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,114 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,114 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,114 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,115 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:57,115 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:57,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,116 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,116 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,117 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:57,117 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:57,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,118 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,119 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,119 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:57,119 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:57,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,120 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,120 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,121 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,121 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,121 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:57,121 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:57,122 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,125 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:57,125 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:57,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:57,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,138 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:57,138 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:57,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:57,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,144 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,145 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:57,145 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:57,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:57,150 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,150 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,150 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,150 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,151 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:57,151 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:57,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:57,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,154 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,154 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,154 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,155 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:57,155 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:57,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:57,157 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,157 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,158 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,158 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,159 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:57,159 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:57,168 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:57,172 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:57,172 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:58:57,173 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:57,173 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:57,174 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:57,174 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 [] [2019-10-22 08:58:57,209 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 08:58:57,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:58:57,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:57,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:57,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:57,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:58:57,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:57,285 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 [2019-10-22 08:58:57,285 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-10-22 08:58:57,315 INFO L76 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. [2019-10-22 08:58:57,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:58:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-10-22 08:58:57,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 5 letters. [2019-10-22 08:58:57,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:57,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 5 letters. [2019-10-22 08:58:57,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:57,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:58:57,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:57,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-10-22 08:58:57,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:57,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2019-10-22 08:58:57,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:58:57,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:58:57,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2019-10-22 08:58:57,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:57,321 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-22 08:58:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2019-10-22 08:58:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-22 08:58:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:58:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-10-22 08:58:57,326 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-22 08:58:57,326 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-22 08:58:57,326 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:58:57,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-10-22 08:58:57,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:57,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:57,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:57,328 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2019-10-22 08:58:57,328 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:57,328 INFO L791 eck$LassoCheckResult]: Stem: 311#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 301#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); 302#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 319#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); 303#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~mem7;havoc main_#t~post8; 304#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 318#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 322#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 321#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); 320#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~mem7;havoc main_#t~post8; 315#L553-2 [2019-10-22 08:58:57,328 INFO L793 eck$LassoCheckResult]: Loop: 315#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 307#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 308#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 312#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); 313#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; 315#L553-2 [2019-10-22 08:58:57,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,328 INFO L82 PathProgramCache]: Analyzing trace with hash 705693310, now seen corresponding path program 1 times [2019-10-22 08:58:57,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:57,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635028555] [2019-10-22 08:58:57,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:57,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635028555] [2019-10-22 08:58:57,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:57,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:58:57,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957688572] [2019-10-22 08:58:57,456 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:58:57,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,457 INFO L82 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 3 times [2019-10-22 08:58:57,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:57,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035907589] [2019-10-22 08:58:57,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:57,468 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:57,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:57,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:57,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:57,578 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-10-22 08:58:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:57,633 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-10-22 08:58:57,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:57,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2019-10-22 08:58:57,635 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:57,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-10-22 08:58:57,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:57,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:57,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:57,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:57,636 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:57,636 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:57,636 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:57,636 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:58:57,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:57,636 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:57,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:57,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:57 BoogieIcfgContainer [2019-10-22 08:58:57,643 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:57,643 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:57,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:57,644 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:57,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:53" (3/4) ... [2019-10-22 08:58:57,648 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:57,648 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:57,649 INFO L168 Benchmark]: Toolchain (without parser) took 5395.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -120.8 MB). Peak memory consumption was 65.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,649 INFO L168 Benchmark]: CDTParser took 1.82 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:57,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:57,651 INFO L168 Benchmark]: Boogie Preprocessor took 20.47 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,651 INFO L168 Benchmark]: RCFGBuilder took 296.38 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,652 INFO L168 Benchmark]: BuchiAutomizer took 4540.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,652 INFO L168 Benchmark]: Witness Printer took 4.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:57,655 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.82 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 484.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.65 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 20.47 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 296.38 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4540.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.33 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. * 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 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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: 24 SDtfs, 20 SDslu, 20 SDs, 0 SdLazy, 71 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital251 mio100 ax107 hnf100 lsp89 ukn59 mio100 lsp37 div161 bol100 ite100 ukn100 eq155 hnf70 smp94 dnf158 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...