./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/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_9f5fc92f-f852-4259-b140-3314a9cdece5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/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 9eff01e8b41fd58fd007a4a54a96fca4ce69974c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/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-1dbac8b [2018-11-10 09:21:03,829 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:21:03,830 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:21:03,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:21:03,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:21:03,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:21:03,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:21:03,839 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:21:03,840 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:21:03,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:21:03,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:21:03,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:21:03,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:21:03,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:21:03,844 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:21:03,845 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:21:03,846 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:21:03,847 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:21:03,848 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:21:03,850 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:21:03,850 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:21:03,851 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:21:03,853 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:21:03,853 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:21:03,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:21:03,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:21:03,855 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:21:03,856 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:21:03,856 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:21:03,857 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:21:03,857 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:21:03,858 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:21:03,858 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:21:03,858 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:21:03,858 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:21:03,859 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:21:03,859 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 09:21:03,869 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:21:03,869 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:21:03,870 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:21:03,871 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:21:03,871 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 09:21:03,871 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 09:21:03,871 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 09:21:03,871 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 09:21:03,871 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 09:21:03,871 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 09:21:03,871 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 09:21:03,872 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:21:03,872 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:21:03,872 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 09:21:03,872 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:21:03,872 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:21:03,872 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:21:03,872 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 09:21:03,873 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 09:21:03,873 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 09:21:03,874 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:21:03,874 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:21:03,875 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 09:21:03,875 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 09:21:03,875 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:21:03,875 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:21:03,875 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 09:21:03,875 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:21:03,875 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 09:21:03,876 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 09:21:03,876 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 09:21:03,876 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_9f5fc92f-f852-4259-b140-3314a9cdece5/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 -> 9eff01e8b41fd58fd007a4a54a96fca4ce69974c [2018-11-10 09:21:03,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:21:03,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:21:03,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:21:03,913 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:21:03,913 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:21:03,914 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/bin-2019/uautomizer/../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-10 09:21:03,956 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/bin-2019/uautomizer/data/868744506/1e249ec8c1a0480bbab758afa46dd4b4/FLAG3c37a3170 [2018-11-10 09:21:04,350 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:21:04,350 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-10 09:21:04,354 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/bin-2019/uautomizer/data/868744506/1e249ec8c1a0480bbab758afa46dd4b4/FLAG3c37a3170 [2018-11-10 09:21:04,365 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/bin-2019/uautomizer/data/868744506/1e249ec8c1a0480bbab758afa46dd4b4 [2018-11-10 09:21:04,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:21:04,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:21:04,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:21:04,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:21:04,371 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:21:04,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:04" (1/1) ... [2018-11-10 09:21:04,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae94ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:04, skipping insertion in model container [2018-11-10 09:21:04,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:04" (1/1) ... [2018-11-10 09:21:04,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:21:04,395 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:21:04,492 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:21:04,494 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:21:04,506 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:21:04,517 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:21:04,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:04 WrapperNode [2018-11-10 09:21:04,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:21:04,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:21:04,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:21:04,518 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:21:04,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:04" (1/1) ... [2018-11-10 09:21:04,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:04" (1/1) ... [2018-11-10 09:21:04,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:21:04,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:21:04,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:21:04,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:21:04,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:04" (1/1) ... [2018-11-10 09:21:04,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:04" (1/1) ... [2018-11-10 09:21:04,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:04" (1/1) ... [2018-11-10 09:21:04,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:04" (1/1) ... [2018-11-10 09:21:04,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:04" (1/1) ... [2018-11-10 09:21:04,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:04" (1/1) ... [2018-11-10 09:21:04,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:04" (1/1) ... [2018-11-10 09:21:04,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:21:04,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:21:04,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:21:04,557 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:21:04,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/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-10 09:21:04,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 09:21:04,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:21:04,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:21:04,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 09:21:04,816 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:21:04,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:21:04 BoogieIcfgContainer [2018-11-10 09:21:04,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:21:04,817 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 09:21:04,817 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 09:21:04,821 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 09:21:04,822 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:21:04,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 09:21:04" (1/3) ... [2018-11-10 09:21:04,823 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e081ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:21:04, skipping insertion in model container [2018-11-10 09:21:04,823 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:21:04,823 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:04" (2/3) ... [2018-11-10 09:21:04,823 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e081ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:21:04, skipping insertion in model container [2018-11-10 09:21:04,823 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:21:04,824 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:21:04" (3/3) ... [2018-11-10 09:21:04,825 INFO L375 chiAutomizerObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-11-10 09:21:04,875 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:21:04,875 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 09:21:04,875 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 09:21:04,875 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 09:21:04,875 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:21:04,876 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:21:04,876 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 09:21:04,876 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:21:04,876 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 09:21:04,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-10 09:21:04,906 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2018-11-10 09:21:04,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:04,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:04,913 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 09:21:04,913 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 09:21:04,913 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 09:21:04,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-10 09:21:04,915 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2018-11-10 09:21:04,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:04,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:04,915 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 09:21:04,915 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 09:21:04,923 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, 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~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 21#L18-4true [2018-11-10 09:21:04,923 INFO L795 eck$LassoCheckResult]: Loop: 21#L18-4true assume true; 7#L18-1true assume !!(main_~i~0 < main_~MAX~0); 24#L19true SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 23#L19-1true havoc main_#t~nondet2; 3#L18-3true main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 21#L18-4true [2018-11-10 09:21:04,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:04,929 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 09:21:04,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:04,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:04,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:04,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:04,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:05,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:05,023 INFO L82 PathProgramCache]: Analyzing trace with hash 34509928, now seen corresponding path program 1 times [2018-11-10 09:21:05,023 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:05,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:05,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:05,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:05,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:05,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:05,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1805949414, now seen corresponding path program 1 times [2018-11-10 09:21:05,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:05,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:05,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:05,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:05,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:05,313 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-10 09:21:05,322 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:05,323 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:05,323 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:05,323 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:05,323 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:05,324 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:05,324 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:05,324 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:05,324 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-10 09:21:05,324 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:05,324 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:05,341 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-10 09:21:05,345 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-10 09:21:05,346 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-10 09:21:05,348 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-10 09:21:05,349 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-10 09:21:05,355 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-10 09:21:05,362 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-10 09:21:05,364 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-10 09:21:05,365 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-10 09:21:05,367 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-10 09:21:05,369 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-10 09:21:05,370 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-10 09:21:05,488 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-10 09:21:05,489 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-10 09:21:05,490 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-10 09:21:05,492 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-10 09:21:05,882 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-10 09:21:05,902 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:05,905 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:05,906 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-10 09:21:05,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:05,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:05,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:05,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,912 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-10 09:21:05,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:05,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:05,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:05,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,915 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-10 09:21:05,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:05,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:05,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:05,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,918 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-10 09:21:05,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:05,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:05,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:05,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,921 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-10 09:21:05,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:05,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:05,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,930 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-10 09:21:05,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:05,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:05,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,938 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-10 09:21:05,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:05,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:05,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:05,941 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,941 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-10 09:21:05,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:05,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:05,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:05,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,943 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-10 09:21:05,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:05,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:05,948 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,949 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-10 09:21:05,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:05,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:05,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:05,951 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,951 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-10 09:21:05,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:05,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:05,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,957 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-10 09:21:05,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:05,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:05,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,962 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-10 09:21:05,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:05,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:05,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,968 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-10 09:21:05,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:05,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:05,974 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,975 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-10 09:21:05,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:05,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:05,986 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,986 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-10 09:21:05,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:05,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:05,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:05,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,989 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-10 09:21:05,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,989 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:21:05,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,990 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:21:05,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:05,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:05,995 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-10 09:21:05,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:05,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:05,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:05,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:05,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:05,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:05,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:05,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:06,000 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-10 09:21:06,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:06,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:06,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:06,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:06,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:06,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:06,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:06,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:06,002 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-10 09:21:06,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:06,003 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:21:06,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:06,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:06,006 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:21:06,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:06,046 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:06,064 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 09:21:06,064 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 09:21:06,065 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:06,066 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:21:06,067 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:06,067 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1, ULTIMATE.start_main_~#str1~0.offset, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1 - 1*ULTIMATE.start_main_~#str1~0.offset - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 09:21:06,097 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 09:21:06,107 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 09:21:06,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:06,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:06,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:06,158 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-10 09:21:06,168 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-10 09:21:06,169 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states. Second operand 4 states. [2018-11-10 09:21:06,219 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states.. Second operand 4 states. Result 58 states and 70 transitions. Complement of second has 8 states. [2018-11-10 09:21:06,219 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-10 09:21:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:21:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-10 09:21:06,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-10 09:21:06,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:06,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 09:21:06,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:06,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-10 09:21:06,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:06,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 70 transitions. [2018-11-10 09:21:06,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-10 09:21:06,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 27 states and 32 transitions. [2018-11-10 09:21:06,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 09:21:06,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 09:21:06,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-11-10 09:21:06,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:06,231 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-10 09:21:06,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-11-10 09:21:06,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-10 09:21:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 09:21:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-10 09:21:06,249 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-10 09:21:06,249 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-10 09:21:06,250 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 09:21:06,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-11-10 09:21:06,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-10 09:21:06,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:06,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:06,251 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 09:21:06,251 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 09:21:06,251 INFO L793 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 162#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, 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~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 163#L18-4 assume true; 154#L18-1 assume !(main_~i~0 < main_~MAX~0); 155#L18-5 SUMMARY for call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1) * 1, 1); srcloc: L18-5 164#L21 main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 165#L25-4 [2018-11-10 09:21:06,251 INFO L795 eck$LassoCheckResult]: Loop: 165#L25-4 assume true; 167#L25-1 assume !!(main_~i~0 >= 0); 169#L26 SUMMARY for call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset + 0, 1); srcloc: L26 170#L26-1 SUMMARY for call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L26-1 174#L26-2 havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 168#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 165#L25-4 [2018-11-10 09:21:06,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:06,252 INFO L82 PathProgramCache]: Analyzing trace with hash 889538727, now seen corresponding path program 1 times [2018-11-10 09:21:06,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:06,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:06,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:06,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:06,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:06,303 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-10 09:21:06,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:06,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:21:06,306 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:06,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:06,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1602309961, now seen corresponding path program 1 times [2018-11-10 09:21:06,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:06,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:06,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:06,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:06,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:06,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:21:06,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:21:06,381 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 09:21:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:06,420 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-10 09:21:06,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:21:06,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2018-11-10 09:21:06,421 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 09:21:06,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 30 states and 32 transitions. [2018-11-10 09:21:06,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 09:21:06,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 09:21:06,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2018-11-10 09:21:06,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:06,422 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-10 09:21:06,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2018-11-10 09:21:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-10 09:21:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 09:21:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-10 09:21:06,424 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-10 09:21:06,424 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-10 09:21:06,424 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 09:21:06,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2018-11-10 09:21:06,425 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 09:21:06,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:06,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:06,425 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:06,425 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 09:21:06,425 INFO L793 eck$LassoCheckResult]: Stem: 239#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 234#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, 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~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 235#L18-4 assume true; 225#L18-1 assume !!(main_~i~0 < main_~MAX~0); 226#L19 SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 228#L19-1 havoc main_#t~nondet2; 217#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 218#L18-4 assume true; 223#L18-1 assume !(main_~i~0 < main_~MAX~0); 224#L18-5 SUMMARY for call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1) * 1, 1); srcloc: L18-5 236#L21 main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 237#L25-4 [2018-11-10 09:21:06,425 INFO L795 eck$LassoCheckResult]: Loop: 237#L25-4 assume true; 238#L25-1 assume !!(main_~i~0 >= 0); 219#L26 SUMMARY for call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset + 0, 1); srcloc: L26 220#L26-1 SUMMARY for call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L26-1 242#L26-2 havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 240#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 237#L25-4 [2018-11-10 09:21:06,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:06,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1918637386, now seen corresponding path program 1 times [2018-11-10 09:21:06,426 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:06,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:06,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:06,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:06,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:06,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1602309961, now seen corresponding path program 2 times [2018-11-10 09:21:06,447 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:06,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:06,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:06,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:06,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:06,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:06,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1788835374, now seen corresponding path program 1 times [2018-11-10 09:21:06,456 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:06,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:06,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:06,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:06,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:06,706 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2018-11-10 09:21:06,869 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2018-11-10 09:21:06,871 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:06,871 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:06,871 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:06,871 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:06,871 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:06,871 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:06,871 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:06,871 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:06,871 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-10 09:21:06,872 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:06,872 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:06,875 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-10 09:21:06,878 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-10 09:21:06,881 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-10 09:21:07,002 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-10 09:21:07,004 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-10 09:21:07,005 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-10 09:21:07,006 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-10 09:21:07,008 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-10 09:21:07,009 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-10 09:21:07,010 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-10 09:21:07,011 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-10 09:21:07,012 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-10 09:21:07,013 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-10 09:21:07,014 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-10 09:21:07,015 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-10 09:21:07,244 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:07,244 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:07,245 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-10 09:21:07,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:07,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:07,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:07,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:07,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:07,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:07,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:07,246 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:07,247 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-10 09:21:07,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:07,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:07,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:07,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:07,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:07,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:07,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:07,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:07,248 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-10 09:21:07,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:07,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:07,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:07,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:07,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:07,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:07,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:07,252 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-10 09:21:07,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:07,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:07,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:07,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:07,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:07,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:07,273 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:07,281 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:07,281 INFO L444 ModelExtractionUtils]: 34 out of 37 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:07,282 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:07,283 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:21:07,283 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:07,283 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-10 09:21:07,303 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-10 09:21:07,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:07,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:07,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:07,330 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-10 09:21:07,330 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-10 09:21:07,330 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 28 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 09:21:07,343 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 28 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 33 states and 36 transitions. Complement of second has 7 states. [2018-11-10 09:21:07,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:21:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-10 09:21:07,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-10 09:21:07,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:07,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 17 letters. Loop has 6 letters. [2018-11-10 09:21:07,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:07,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 12 letters. [2018-11-10 09:21:07,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:07,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2018-11-10 09:21:07,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:21:07,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 28 states and 31 transitions. [2018-11-10 09:21:07,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 09:21:07,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 09:21:07,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2018-11-10 09:21:07,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:07,348 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-10 09:21:07,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2018-11-10 09:21:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-10 09:21:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 09:21:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-10 09:21:07,350 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-10 09:21:07,350 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-10 09:21:07,350 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 09:21:07,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2018-11-10 09:21:07,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:21:07,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:07,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:07,351 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:07,351 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:07,351 INFO L793 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 391#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, 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~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 392#L18-4 assume true; 383#L18-1 assume !!(main_~i~0 < main_~MAX~0); 384#L19 SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 386#L19-1 havoc main_#t~nondet2; 375#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 376#L18-4 assume true; 381#L18-1 assume !(main_~i~0 < main_~MAX~0); 382#L18-5 SUMMARY for call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1) * 1, 1); srcloc: L18-5 394#L21 main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 395#L25-4 assume true; 397#L25-1 assume !(main_~i~0 >= 0); 390#L25-5 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 379#L31-4 [2018-11-10 09:21:07,351 INFO L795 eck$LassoCheckResult]: Loop: 379#L31-4 assume true; 380#L31-1 assume !!(main_~i~0 < main_~MAX~0); 387#L32 SUMMARY for call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L32 393#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L32-1 388#L32-2 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 389#L4 assume !(__VERIFIER_assert_~cond == 0); 401#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem8;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; 385#L31-3 main_#t~post6 := main_~i~0;main_~i~0 := main_#t~post6 + 1;havoc main_#t~post6; 379#L31-4 [2018-11-10 09:21:07,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:07,351 INFO L82 PathProgramCache]: Analyzing trace with hash 701615097, now seen corresponding path program 1 times [2018-11-10 09:21:07,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:07,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:07,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:07,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:07,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:07,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:07,407 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/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-10 09:21:07,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:07,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:07,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:07,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2018-11-10 09:21:07,477 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:07,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:07,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1439866352, now seen corresponding path program 1 times [2018-11-10 09:21:07,477 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:07,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:07,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:07,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:07,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:07,698 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-11-10 09:21:07,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:21:07,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:21:07,699 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-10 09:21:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:07,778 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-10 09:21:07,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 09:21:07,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 44 transitions. [2018-11-10 09:21:07,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:21:07,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 43 transitions. [2018-11-10 09:21:07,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 09:21:07,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-10 09:21:07,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 43 transitions. [2018-11-10 09:21:07,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:07,781 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-10 09:21:07,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 43 transitions. [2018-11-10 09:21:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-11-10 09:21:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 09:21:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-10 09:21:07,783 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-10 09:21:07,783 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-10 09:21:07,783 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 09:21:07,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2018-11-10 09:21:07,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:21:07,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:07,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:07,785 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:07,785 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:07,785 INFO L793 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 511#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, 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~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 512#L18-4 assume true; 503#L18-1 assume !!(main_~i~0 < main_~MAX~0); 504#L19 SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 506#L19-1 havoc main_#t~nondet2; 495#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 496#L18-4 assume true; 501#L18-1 assume !(main_~i~0 < main_~MAX~0); 502#L18-5 SUMMARY for call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1) * 1, 1); srcloc: L18-5 514#L21 main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 515#L25-4 assume true; 516#L25-1 assume !!(main_~i~0 >= 0); 497#L26 SUMMARY for call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset + 0, 1); srcloc: L26 498#L26-1 SUMMARY for call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L26-1 522#L26-2 havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 520#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 517#L25-4 assume true; 518#L25-1 assume !(main_~i~0 >= 0); 510#L25-5 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 499#L31-4 [2018-11-10 09:21:07,785 INFO L795 eck$LassoCheckResult]: Loop: 499#L31-4 assume true; 500#L31-1 assume !!(main_~i~0 < main_~MAX~0); 507#L32 SUMMARY for call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L32 513#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L32-1 508#L32-2 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 509#L4 assume !(__VERIFIER_assert_~cond == 0); 521#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem8;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; 505#L31-3 main_#t~post6 := main_~i~0;main_~i~0 := main_#t~post6 + 1;havoc main_#t~post6; 499#L31-4 [2018-11-10 09:21:07,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:07,788 INFO L82 PathProgramCache]: Analyzing trace with hash 759605873, now seen corresponding path program 1 times [2018-11-10 09:21:07,788 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:07,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:07,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:07,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:07,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:07,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:07,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1439866352, now seen corresponding path program 2 times [2018-11-10 09:21:07,815 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:07,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:07,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:07,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:07,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:07,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2128962432, now seen corresponding path program 1 times [2018-11-10 09:21:07,822 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:07,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:07,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:07,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:07,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:08,111 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2018-11-10 09:21:08,245 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2018-11-10 09:21:08,247 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:08,247 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:08,247 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:08,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:08,247 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:08,247 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:08,247 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:08,247 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:08,247 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration5_Lasso [2018-11-10 09:21:08,247 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:08,247 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:08,249 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-10 09:21:08,251 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-10 09:21:08,254 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-10 09:21:08,255 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-10 09:21:08,257 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-10 09:21:08,409 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-10 09:21:08,411 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-10 09:21:08,412 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-10 09:21:08,413 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-10 09:21:08,414 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-10 09:21:08,416 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-10 09:21:08,417 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-10 09:21:08,418 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-10 09:21:08,419 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-10 09:21:08,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-10 09:21:08,421 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-10 09:21:08,697 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:08,698 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:08,698 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-10 09:21:08,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:08,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:08,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:08,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:08,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:08,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:08,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:08,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:08,702 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-10 09:21:08,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:08,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:08,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:08,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:08,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:08,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:08,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:08,707 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-10 09:21:08,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:08,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:08,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:08,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:08,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:08,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:08,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:08,709 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:08,709 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-10 09:21:08,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:08,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:08,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:08,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:08,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:08,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:08,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:08,715 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:08,716 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-10 09:21:08,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:08,716 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:21:08,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:08,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:08,717 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:21:08,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:08,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:08,719 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-10 09:21:08,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:08,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:08,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:08,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:08,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:08,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:08,736 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:08,747 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:08,747 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 09:21:08,747 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:08,748 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:21:08,748 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:08,748 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-10 09:21:08,791 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 09:21:08,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:08,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:08,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:08,858 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-10 09:21:08,859 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-10 09:21:08,859 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 30 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-10 09:21:08,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 30 transitions. cyclomatic complexity: 5. Second operand 8 states. Result 72 states and 77 transitions. Complement of second has 13 states. [2018-11-10 09:21:08,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-10 09:21:08,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 09:21:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2018-11-10 09:21:08,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 20 letters. Loop has 8 letters. [2018-11-10 09:21:08,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:08,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-10 09:21:08,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:08,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 20 letters. Loop has 16 letters. [2018-11-10 09:21:08,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:08,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 77 transitions. [2018-11-10 09:21:08,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:21:08,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 39 states and 41 transitions. [2018-11-10 09:21:08,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 09:21:08,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 09:21:08,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2018-11-10 09:21:08,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:08,949 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-10 09:21:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2018-11-10 09:21:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-10 09:21:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 09:21:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-10 09:21:08,951 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-10 09:21:08,951 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-10 09:21:08,951 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 09:21:08,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2018-11-10 09:21:08,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:21:08,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:08,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:08,952 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:08,952 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:08,952 INFO L793 eck$LassoCheckResult]: Stem: 781#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 773#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, 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~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 774#L18-4 assume true; 785#L18-1 assume !!(main_~i~0 < main_~MAX~0); 788#L19 SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 787#L19-1 havoc main_#t~nondet2; 756#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 757#L18-4 assume true; 764#L18-1 assume !!(main_~i~0 < main_~MAX~0); 765#L19 SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 767#L19-1 havoc main_#t~nondet2; 768#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 786#L18-4 assume true; 762#L18-1 assume !(main_~i~0 < main_~MAX~0); 763#L18-5 SUMMARY for call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1) * 1, 1); srcloc: L18-5 780#L21 main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 776#L25-4 assume true; 777#L25-1 assume !!(main_~i~0 >= 0); 758#L26 SUMMARY for call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset + 0, 1); srcloc: L26 759#L26-1 SUMMARY for call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L26-1 784#L26-2 havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 782#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 778#L25-4 assume true; 779#L25-1 assume !(main_~i~0 >= 0); 772#L25-5 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 760#L31-4 [2018-11-10 09:21:08,952 INFO L795 eck$LassoCheckResult]: Loop: 760#L31-4 assume true; 761#L31-1 assume !!(main_~i~0 < main_~MAX~0); 769#L32 SUMMARY for call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L32 775#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L32-1 770#L32-2 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 771#L4 assume !(__VERIFIER_assert_~cond == 0); 783#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem8;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; 766#L31-3 main_#t~post6 := main_~i~0;main_~i~0 := main_#t~post6 + 1;havoc main_#t~post6; 760#L31-4 [2018-11-10 09:21:08,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:08,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1803361748, now seen corresponding path program 2 times [2018-11-10 09:21:08,952 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:08,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:08,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:08,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:08,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:09,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:09,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:09,003 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f5fc92f-f852-4259-b140-3314a9cdece5/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:21:09,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:21:09,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:21:09,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:09,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:09,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:09,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2018-11-10 09:21:09,080 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:09,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:09,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1439866352, now seen corresponding path program 3 times [2018-11-10 09:21:09,080 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:09,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:09,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:09,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:09,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:09,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 09:21:09,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:21:09,169 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-11-10 09:21:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:09,246 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-10 09:21:09,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:21:09,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 52 transitions. [2018-11-10 09:21:09,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:21:09,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 49 states and 51 transitions. [2018-11-10 09:21:09,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 09:21:09,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-10 09:21:09,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 51 transitions. [2018-11-10 09:21:09,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:09,248 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-11-10 09:21:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 51 transitions. [2018-11-10 09:21:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2018-11-10 09:21:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 09:21:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-10 09:21:09,250 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-10 09:21:09,250 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-10 09:21:09,250 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 09:21:09,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2018-11-10 09:21:09,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:21:09,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:09,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:09,252 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:09,252 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:09,252 INFO L793 eck$LassoCheckResult]: Stem: 951#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 944#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, 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~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~MAX~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 945#L18-4 assume true; 957#L18-1 assume !!(main_~i~0 < main_~MAX~0); 964#L19 SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 962#L19-1 havoc main_#t~nondet2; 960#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 958#L18-4 assume true; 935#L18-1 assume !!(main_~i~0 < main_~MAX~0); 936#L19 SUMMARY for call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L19 938#L19-1 havoc main_#t~nondet2; 927#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 928#L18-4 assume true; 933#L18-1 assume !(main_~i~0 < main_~MAX~0); 934#L18-5 SUMMARY for call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1) * 1, 1); srcloc: L18-5 950#L21 main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 946#L25-4 assume true; 947#L25-1 assume !!(main_~i~0 >= 0); 956#L26 SUMMARY for call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset + 0, 1); srcloc: L26 959#L26-1 SUMMARY for call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L26-1 954#L26-2 havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 952#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 948#L25-4 assume true; 949#L25-1 assume !!(main_~i~0 >= 0); 929#L26 SUMMARY for call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset + 0, 1); srcloc: L26 930#L26-1 SUMMARY for call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L26-1 965#L26-2 havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 963#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 961#L25-4 assume true; 955#L25-1 assume !(main_~i~0 >= 0); 942#L25-5 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 931#L31-4 [2018-11-10 09:21:09,252 INFO L795 eck$LassoCheckResult]: Loop: 931#L31-4 assume true; 932#L31-1 assume !!(main_~i~0 < main_~MAX~0); 939#L32 SUMMARY for call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0 * 1, 1); srcloc: L32 943#L32-1 SUMMARY for call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0 * 1, 1); srcloc: L32-1 940#L32-2 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 941#L4 assume !(__VERIFIER_assert_~cond == 0); 953#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem8;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; 937#L31-3 main_#t~post6 := main_~i~0;main_~i~0 := main_#t~post6 + 1;havoc main_#t~post6; 931#L31-4 [2018-11-10 09:21:09,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:09,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1550183436, now seen corresponding path program 3 times [2018-11-10 09:21:09,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:09,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:09,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:09,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:09,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:09,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:09,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1439866352, now seen corresponding path program 4 times [2018-11-10 09:21:09,281 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:09,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:09,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:09,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:09,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:09,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:09,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1188565787, now seen corresponding path program 2 times [2018-11-10 09:21:09,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:09,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:09,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:09,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:09,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:09,784 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 132 [2018-11-10 09:21:09,970 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-11-10 09:21:09,972 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:09,972 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:09,972 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:09,972 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:09,972 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:09,972 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:09,972 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:09,972 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:09,972 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-10 09:21:09,972 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:09,972 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:09,975 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-10 09:21:09,978 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-10 09:21:09,979 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-10 09:21:09,981 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-10 09:21:09,984 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-10 09:21:09,987 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-10 09:21:10,037 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:284) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:538) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:250) 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-10 09:21:10,039 INFO L168 Benchmark]: Toolchain (without parser) took 5671.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 959.2 MB in the beginning and 977.5 MB in the end (delta: -18.3 MB). Peak memory consumption was 172.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:21:10,040 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:21:10,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.90 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 947.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 09:21:10,041 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.20 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:21:10,041 INFO L168 Benchmark]: Boogie Preprocessor took 14.46 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:21:10,042 INFO L168 Benchmark]: RCFGBuilder took 259.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-10 09:21:10,042 INFO L168 Benchmark]: BuchiAutomizer took 5221.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 977.5 MB in the end (delta: 136.3 MB). Peak memory consumption was 192.9 MB. Max. memory is 11.5 GB. [2018-11-10 09:21:10,046 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 148.90 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 947.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.20 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.46 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 259.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5221.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 977.5 MB in the end (delta: 136.3 MB). Peak memory consumption was 192.9 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...