./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/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 32bit --witnessprinter.graph.data.programhash 561472dda653ab23fa8eff641224e01683fc61ba ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:36:37,181 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:36:37,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:36:37,187 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:36:37,188 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:36:37,188 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:36:37,189 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:36:37,190 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:36:37,191 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:36:37,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:36:37,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:36:37,193 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:36:37,194 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:36:37,194 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:36:37,195 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:36:37,196 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:36:37,196 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:36:37,197 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:36:37,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:36:37,200 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:36:37,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:36:37,201 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:36:37,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:36:37,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:36:37,203 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:36:37,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:36:37,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:36:37,205 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:36:37,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:36:37,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:36:37,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:36:37,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:36:37,207 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:36:37,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:36:37,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:36:37,209 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:36:37,209 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 11:36:37,216 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:36:37,217 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:36:37,218 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:36:37,218 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:36:37,218 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:36:37,218 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:36:37,218 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:36:37,218 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:36:37,218 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:36:37,219 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:36:37,219 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:36:37,219 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:36:37,219 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:36:37,219 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:36:37,219 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:36:37,220 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:36:37,220 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:36:37,220 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:36:37,220 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:36:37,220 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:36:37,220 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:36:37,220 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:36:37,221 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:36:37,221 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:36:37,221 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:36:37,221 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:36:37,221 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:36:37,221 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:36:37,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:36:37,222 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:36:37,222 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:36:37,222 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:36:37,222 INFO L133 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_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 561472dda653ab23fa8eff641224e01683fc61ba [2018-11-28 11:36:37,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:36:37,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:36:37,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:36:37,255 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:36:37,255 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:36:37,256 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/uautomizer/../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-28 11:36:37,291 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/uautomizer/data/2c3fc9684/483bc5f1caea4dbdaba4f6d847a1fe49/FLAG311da93ac [2018-11-28 11:36:37,585 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:36:37,586 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-28 11:36:37,589 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/uautomizer/data/2c3fc9684/483bc5f1caea4dbdaba4f6d847a1fe49/FLAG311da93ac [2018-11-28 11:36:37,597 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/uautomizer/data/2c3fc9684/483bc5f1caea4dbdaba4f6d847a1fe49 [2018-11-28 11:36:37,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:36:37,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:36:37,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:36:37,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:36:37,603 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:36:37,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:36:37" (1/1) ... [2018-11-28 11:36:37,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c084065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:37, skipping insertion in model container [2018-11-28 11:36:37,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:36:37" (1/1) ... [2018-11-28 11:36:37,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:36:37,621 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:36:37,717 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:36:37,719 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:36:37,733 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:36:37,745 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:36:37,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:37 WrapperNode [2018-11-28 11:36:37,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:36:37,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:36:37,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:36:37,746 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:36:37,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:37" (1/1) ... [2018-11-28 11:36:37,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:37" (1/1) ... [2018-11-28 11:36:37,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:36:37,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:36:37,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:36:37,777 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:36:37,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:37" (1/1) ... [2018-11-28 11:36:37,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:37" (1/1) ... [2018-11-28 11:36:37,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:37" (1/1) ... [2018-11-28 11:36:37,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:37" (1/1) ... [2018-11-28 11:36:37,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:37" (1/1) ... [2018-11-28 11:36:37,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:37" (1/1) ... [2018-11-28 11:36:37,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:37" (1/1) ... [2018-11-28 11:36:37,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:36:37,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:36:37,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:36:37,834 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:36:37,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/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 [2018-11-28 11:36:37,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:36:37,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:36:37,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:36:37,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:36:37,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:36:37,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:36:38,025 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:36:38,025 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 11:36:38,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:36:38 BoogieIcfgContainer [2018-11-28 11:36:38,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:36:38,027 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:36:38,027 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:36:38,030 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:36:38,031 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:36:38,031 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:36:37" (1/3) ... [2018-11-28 11:36:38,032 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@588aeb00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:36:38, skipping insertion in model container [2018-11-28 11:36:38,032 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:36:38,033 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:36:37" (2/3) ... [2018-11-28 11:36:38,033 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@588aeb00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:36:38, skipping insertion in model container [2018-11-28 11:36:38,033 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:36:38,033 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:36:38" (3/3) ... [2018-11-28 11:36:38,034 INFO L375 chiAutomizerObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-11-28 11:36:38,081 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:36:38,082 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:36:38,082 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:36:38,082 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:36:38,082 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:36:38,082 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:36:38,082 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:36:38,082 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:36:38,082 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:36:38,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 11:36:38,113 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:36:38,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:38,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:38,118 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:36:38,118 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:36:38,118 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:36:38,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 11:36:38,120 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 11:36:38,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:38,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:38,120 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:36:38,120 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:36:38,125 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 6#L20-3true [2018-11-28 11:36:38,126 INFO L796 eck$LassoCheckResult]: Loop: 6#L20-3true assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 7#L20-2true main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6#L20-3true [2018-11-28 11:36:38,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 11:36:38,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:38,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:38,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:38,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:38,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:38,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:38,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-28 11:36:38,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:38,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:38,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:38,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:38,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:38,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:38,229 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-28 11:36:38,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:38,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:38,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:38,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:38,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:38,516 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-11-28 11:36:38,525 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:36:38,526 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:36:38,526 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:36:38,526 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:36:38,526 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:36:38,526 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:36:38,526 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:36:38,527 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:36:38,527 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-28 11:36:38,527 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:36:38,527 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:36:38,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:38,803 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:36:38,807 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:36:38,808 INFO L122 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 [2018-11-28 11:36:38,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:38,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:38,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:38,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:38,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:38,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:38,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:38,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:38,813 INFO L122 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 [2018-11-28 11:36:38,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:38,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:38,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:38,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:38,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:38,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:38,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:38,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:38,815 INFO L122 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 [2018-11-28 11:36:38,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:38,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:38,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:38,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:38,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:38,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:38,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:38,822 INFO L122 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 [2018-11-28 11:36:38,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:38,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:38,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:38,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:38,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:38,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:38,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:38,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:38,825 INFO L122 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 [2018-11-28 11:36:38,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:38,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:38,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:38,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:38,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:38,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:38,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:38,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:38,828 INFO L122 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 [2018-11-28 11:36:38,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:38,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:38,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:38,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:38,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:38,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:38,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:38,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:38,831 INFO L122 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 [2018-11-28 11:36:38,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:38,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:38,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:38,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:38,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:38,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:38,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:38,843 INFO L122 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 [2018-11-28 11:36:38,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:38,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:38,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:38,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:38,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:38,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:38,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:38,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:38,846 INFO L122 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 [2018-11-28 11:36:38,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:38,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:38,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:38,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:38,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:38,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:38,876 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:36:38,898 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 11:36:38,898 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 11:36:38,900 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:36:38,902 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:36:38,902 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:36:38,903 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~MAX~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~MAX~0 Supporting invariants [] [2018-11-28 11:36:38,920 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 11:36:38,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:38,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:36:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:38,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:36:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:36:38,993 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 11:36:38,994 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2018-11-28 11:36:39,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 8 states. [2018-11-28 11:36:39,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:36:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:36:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-28 11:36:39,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-28 11:36:39,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:39,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 11:36:39,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:39,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 11:36:39,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:39,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2018-11-28 11:36:39,033 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 11:36:39,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2018-11-28 11:36:39,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 11:36:39,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 11:36:39,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-11-28 11:36:39,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:36:39,037 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 11:36:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-11-28 11:36:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-28 11:36:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 11:36:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-28 11:36:39,053 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 11:36:39,053 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 11:36:39,053 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:36:39,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-28 11:36:39,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 11:36:39,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:39,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:39,054 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 11:36:39,054 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:36:39,055 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 112#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 107#L20-3 assume !(main_~i~0 < main_~MAX~0); 105#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 106#L27-3 [2018-11-28 11:36:39,055 INFO L796 eck$LassoCheckResult]: Loop: 106#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 115#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 106#L27-3 [2018-11-28 11:36:39,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:39,055 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-28 11:36:39,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:39,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:39,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:39,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:39,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:36:39,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:36:39,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:36:39,098 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:36:39,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:39,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2018-11-28 11:36:39,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:39,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:39,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:39,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:39,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:36:39,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:36:39,149 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 11:36:39,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:36:39,165 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-28 11:36:39,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:36:39,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-28 11:36:39,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 11:36:39,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2018-11-28 11:36:39,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 11:36:39,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 11:36:39,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-28 11:36:39,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:36:39,168 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 11:36:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-28 11:36:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-28 11:36:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 11:36:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-28 11:36:39,169 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 11:36:39,169 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 11:36:39,169 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:36:39,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-28 11:36:39,170 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 11:36:39,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:39,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:39,170 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:36:39,170 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 11:36:39,170 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 139#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 140#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 146#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 147#L20-3 assume !(main_~i~0 < main_~MAX~0); 144#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 145#L27-3 [2018-11-28 11:36:39,170 INFO L796 eck$LassoCheckResult]: Loop: 145#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 149#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 145#L27-3 [2018-11-28 11:36:39,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:39,171 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-28 11:36:39,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:39,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:39,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:39,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:39,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:39,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:39,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2018-11-28 11:36:39,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:39,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:39,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:39,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:39,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:39,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:39,199 INFO L82 PathProgramCache]: Analyzing trace with hash 265181135, now seen corresponding path program 1 times [2018-11-28 11:36:39,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:39,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:39,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:39,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:36:39,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:39,379 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-11-28 11:36:39,467 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:36:39,467 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:36:39,467 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:36:39,468 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:36:39,468 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:36:39,468 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:36:39,468 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:36:39,468 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:36:39,468 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-28 11:36:39,468 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:36:39,468 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:36:39,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:39,731 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:36:39,731 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:36:39,732 INFO L122 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 [2018-11-28 11:36:39,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:39,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:39,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:39,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:39,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:39,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:39,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:39,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:39,734 INFO L122 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 [2018-11-28 11:36:39,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:39,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:39,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:39,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:39,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:39,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:39,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:39,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:39,737 INFO L122 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 [2018-11-28 11:36:39,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:39,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:39,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:39,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:39,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:39,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:39,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:39,743 INFO L122 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 [2018-11-28 11:36:39,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:39,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:39,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:39,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:39,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:39,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:39,773 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:36:39,799 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 11:36:39,800 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 11:36:39,800 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:36:39,801 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:36:39,802 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:36:39,802 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_2, ULTIMATE.start_main_~#str2~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_2 - 1*ULTIMATE.start_main_~#str2~0.offset - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 11:36:39,812 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 11:36:39,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:36:39,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:39,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:36:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:39,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:36:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:36:39,899 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 11:36:39,899 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 11:36:39,906 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 17 states and 21 transitions. Complement of second has 5 states. [2018-11-28 11:36:39,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:36:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 11:36:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-28 11:36:39,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 11:36:39,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:39,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 11:36:39,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:39,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 11:36:39,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:39,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-28 11:36:39,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:36:39,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2018-11-28 11:36:39,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 11:36:39,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 11:36:39,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-28 11:36:39,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:36:39,911 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 11:36:39,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-28 11:36:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 11:36:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 11:36:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-28 11:36:39,912 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 11:36:39,912 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 11:36:39,912 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:36:39,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-28 11:36:39,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:36:39,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:39,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:39,913 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:36:39,913 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:36:39,913 INFO L794 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 224#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 225#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 233#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 234#L20-3 assume !(main_~i~0 < main_~MAX~0); 231#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 232#L27-3 assume !(main_~i~0 >= 0); 235#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 227#L33-3 [2018-11-28 11:36:39,913 INFO L796 eck$LassoCheckResult]: Loop: 227#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 228#L5 assume !(0 == __VERIFIER_assert_~cond); 229#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 226#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 227#L33-3 [2018-11-28 11:36:39,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:39,914 INFO L82 PathProgramCache]: Analyzing trace with hash 265181077, now seen corresponding path program 1 times [2018-11-28 11:36:39,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:39,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:39,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:39,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:39,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:36:39,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:36:39,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:36:39,936 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:36:39,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:39,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 1 times [2018-11-28 11:36:39,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:39,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:39,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:39,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:39,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:40,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:36:40,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:36:40,026 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-28 11:36:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:36:40,045 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-28 11:36:40,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:36:40,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-28 11:36:40,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:36:40,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2018-11-28 11:36:40,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 11:36:40,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 11:36:40,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2018-11-28 11:36:40,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:36:40,046 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 11:36:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2018-11-28 11:36:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 11:36:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 11:36:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-28 11:36:40,047 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 11:36:40,047 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 11:36:40,047 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:36:40,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-11-28 11:36:40,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:36:40,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:40,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:40,048 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:36:40,048 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:36:40,048 INFO L794 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 265#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 266#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 272#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 273#L20-3 assume !(main_~i~0 < main_~MAX~0); 270#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 271#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 277#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 275#L27-3 assume !(main_~i~0 >= 0); 274#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 264#L33-3 [2018-11-28 11:36:40,048 INFO L796 eck$LassoCheckResult]: Loop: 264#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 267#L5 assume !(0 == __VERIFIER_assert_~cond); 268#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 263#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 264#L33-3 [2018-11-28 11:36:40,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:40,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1436000983, now seen corresponding path program 1 times [2018-11-28 11:36:40,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:40,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:40,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:40,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:40,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:40,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:40,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 2 times [2018-11-28 11:36:40,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:40,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:40,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:40,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:40,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:40,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1461824416, now seen corresponding path program 1 times [2018-11-28 11:36:40,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:40,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:40,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:40,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:36:40,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:40,321 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2018-11-28 11:36:40,416 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:36:40,416 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:36:40,417 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:36:40,417 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:36:40,417 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:36:40,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:36:40,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:36:40,417 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:36:40,417 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration5_Lasso [2018-11-28 11:36:40,417 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:36:40,417 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:36:40,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:40,711 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:36:40,711 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:36:40,711 INFO L122 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 [2018-11-28 11:36:40,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:40,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:40,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:40,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:40,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:40,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:40,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:40,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:40,713 INFO L122 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 [2018-11-28 11:36:40,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:40,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:40,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:40,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:40,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:40,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:40,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:40,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:40,715 INFO L122 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 [2018-11-28 11:36:40,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:40,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:36:40,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:40,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:40,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:40,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:36:40,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:36:40,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:40,721 INFO L122 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 [2018-11-28 11:36:40,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:40,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:40,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:40,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:40,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:40,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:40,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:36:40,725 INFO L122 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 [2018-11-28 11:36:40,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:36:40,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:36:40,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:36:40,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:36:40,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:36:40,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:36:40,746 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:36:40,758 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 11:36:40,758 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 11:36:40,760 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:36:40,760 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:36:40,761 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:36:40,761 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-28 11:36:40,780 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 11:36:40,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:40,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:36:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:40,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:36:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:36:40,859 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-28 11:36:40,860 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-28 11:36:40,953 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 34 states and 39 transitions. Complement of second has 10 states. [2018-11-28 11:36:40,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-28 11:36:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 11:36:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2018-11-28 11:36:40,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 11:36:40,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:40,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 11:36:40,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:40,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-28 11:36:40,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:36:40,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2018-11-28 11:36:40,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:36:40,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 20 states and 22 transitions. [2018-11-28 11:36:40,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 11:36:40,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 11:36:40,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-11-28 11:36:40,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:36:40,957 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-28 11:36:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-11-28 11:36:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-28 11:36:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 11:36:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-28 11:36:40,958 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 11:36:40,958 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-28 11:36:40,958 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:36:40,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-28 11:36:40,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:36:40,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:40,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:40,959 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:36:40,959 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:36:40,960 INFO L794 eck$LassoCheckResult]: Stem: 419#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 413#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 414#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 422#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 423#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 424#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 429#L20-3 assume !(main_~i~0 < main_~MAX~0); 420#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 421#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 426#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 428#L27-3 assume !(main_~i~0 >= 0); 425#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 416#L33-3 [2018-11-28 11:36:40,960 INFO L796 eck$LassoCheckResult]: Loop: 416#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 417#L5 assume !(0 == __VERIFIER_assert_~cond); 418#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 415#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 416#L33-3 [2018-11-28 11:36:40,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:40,960 INFO L82 PathProgramCache]: Analyzing trace with hash 780803417, now seen corresponding path program 2 times [2018-11-28 11:36:40,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:40,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:40,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:40,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:36:40,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:36:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:36:40,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:36:40,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_865c2677-c17f-470a-8de4-2fa067c130fd/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:36:41,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:36:41,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:36:41,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:36:41,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:36:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:36:41,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:36:41,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-11-28 11:36:41,054 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:36:41,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:41,054 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 3 times [2018-11-28 11:36:41,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:41,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:41,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:41,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:36:41,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:41,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:36:41,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:36:41,144 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-28 11:36:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:36:41,200 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-28 11:36:41,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:36:41,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2018-11-28 11:36:41,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:36:41,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 25 transitions. [2018-11-28 11:36:41,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 11:36:41,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 11:36:41,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2018-11-28 11:36:41,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:36:41,201 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-28 11:36:41,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2018-11-28 11:36:41,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-11-28 11:36:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 11:36:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-28 11:36:41,203 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 11:36:41,203 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-28 11:36:41,203 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:36:41,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2018-11-28 11:36:41,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:36:41,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:36:41,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:36:41,204 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 11:36:41,204 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:36:41,204 INFO L794 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 504#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 505#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 511#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 512#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 513#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 518#L20-3 assume !(main_~i~0 < main_~MAX~0); 508#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 509#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 515#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 516#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 517#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 519#L27-3 assume !(main_~i~0 >= 0); 514#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 503#L33-3 [2018-11-28 11:36:41,204 INFO L796 eck$LassoCheckResult]: Loop: 503#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 506#L5 assume !(0 == __VERIFIER_assert_~cond); 507#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 502#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 503#L33-3 [2018-11-28 11:36:41,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:41,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1267136613, now seen corresponding path program 3 times [2018-11-28 11:36:41,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:41,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:41,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:41,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:36:41,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:41,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 4 times [2018-11-28 11:36:41,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:41,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:41,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:41,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:36:41,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:41,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:36:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash 993507108, now seen corresponding path program 2 times [2018-11-28 11:36:41,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:36:41,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:36:41,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:41,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:36:41,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:36:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:36:41,884 WARN L180 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 122 [2018-11-28 11:36:42,066 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2018-11-28 11:36:42,067 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:36:42,067 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:36:42,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:36:42,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:36:42,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:36:42,068 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:36:42,068 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:36:42,068 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:36:42,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-28 11:36:42,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:36:42,068 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:36:42,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:42,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:42,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:42,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:42,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:42,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:42,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:42,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:42,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:42,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:42,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:42,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:36:42,119 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-28 11:36:42,121 INFO L168 Benchmark]: Toolchain (without parser) took 4521.53 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.5 MB). Free memory was 954.4 MB in the beginning and 1.3 GB in the end (delta: -354.7 MB). Peak memory consumption was 382.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:36:42,121 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:36:42,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.23 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:36:42,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.78 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:36:42,122 INFO L168 Benchmark]: Boogie Preprocessor took 57.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -199.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:36:42,123 INFO L168 Benchmark]: RCFGBuilder took 192.04 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: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:36:42,123 INFO L168 Benchmark]: BuchiAutomizer took 4093.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -183.8 MB). Peak memory consumption was 401.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:36:42,126 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.23 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.78 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -199.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 192.04 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: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4093.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -183.8 MB). Peak memory consumption was 401.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...