./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loops/invert_string_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/invert_string_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/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 60adf12976c621166b8ffd5e872004e7d6c30802 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/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-5842f4b [2018-11-18 14:19:44,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:19:44,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:19:44,636 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:19:44,636 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:19:44,637 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:19:44,638 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:19:44,639 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:19:44,641 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:19:44,641 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:19:44,643 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:19:44,649 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:19:44,650 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:19:44,651 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:19:44,652 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:19:44,652 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:19:44,653 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:19:44,654 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:19:44,656 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:19:44,657 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:19:44,658 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:19:44,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:19:44,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:19:44,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:19:44,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:19:44,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:19:44,662 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:19:44,662 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:19:44,663 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:19:44,663 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:19:44,664 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:19:44,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:19:44,664 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:19:44,665 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:19:44,665 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:19:44,666 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:19:44,666 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 14:19:44,674 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:19:44,674 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:19:44,675 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:19:44,675 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:19:44,675 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:19:44,675 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 14:19:44,675 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 14:19:44,675 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 14:19:44,675 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 14:19:44,675 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 14:19:44,676 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 14:19:44,676 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:19:44,676 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:19:44,676 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 14:19:44,676 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:19:44,676 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:19:44,676 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:19:44,679 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 14:19:44,680 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 14:19:44,680 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 14:19:44,680 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:19:44,680 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:19:44,680 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 14:19:44,680 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:19:44,680 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 14:19:44,681 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:19:44,681 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:19:44,681 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 14:19:44,681 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:19:44,681 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:19:44,681 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 14:19:44,682 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 14:19:44,682 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_1a80c847-f8c6-41d7-b57b-8d501fbaa602/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 -> 60adf12976c621166b8ffd5e872004e7d6c30802 [2018-11-18 14:19:44,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:19:44,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:19:44,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:19:44,721 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:19:44,721 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:19:44,722 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/../../sv-benchmarks/c/loops/invert_string_true-unreach-call_true-termination.i [2018-11-18 14:19:44,769 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/data/893837691/03a9f76aeea74ef89b293ea20212e6ba/FLAG37914ab29 [2018-11-18 14:19:45,131 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:19:45,131 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/sv-benchmarks/c/loops/invert_string_true-unreach-call_true-termination.i [2018-11-18 14:19:45,137 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/data/893837691/03a9f76aeea74ef89b293ea20212e6ba/FLAG37914ab29 [2018-11-18 14:19:45,534 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/data/893837691/03a9f76aeea74ef89b293ea20212e6ba [2018-11-18 14:19:45,536 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:19:45,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:19:45,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:19:45,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:19:45,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:19:45,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:19:45" (1/1) ... [2018-11-18 14:19:45,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac16c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:45, skipping insertion in model container [2018-11-18 14:19:45,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:19:45" (1/1) ... [2018-11-18 14:19:45,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:19:45,563 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:19:45,675 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:19:45,677 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:19:45,690 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:19:45,703 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:19:45,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:45 WrapperNode [2018-11-18 14:19:45,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:19:45,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:19:45,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:19:45,704 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:19:45,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:45" (1/1) ... [2018-11-18 14:19:45,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:45" (1/1) ... [2018-11-18 14:19:45,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:19:45,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:19:45,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:19:45,730 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:19:45,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:45" (1/1) ... [2018-11-18 14:19:45,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:45" (1/1) ... [2018-11-18 14:19:45,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:45" (1/1) ... [2018-11-18 14:19:45,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:45" (1/1) ... [2018-11-18 14:19:45,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:45" (1/1) ... [2018-11-18 14:19:45,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:45" (1/1) ... [2018-11-18 14:19:45,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:45" (1/1) ... [2018-11-18 14:19:45,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:19:45,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:19:45,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:19:45,783 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:19:45,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/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-18 14:19:45,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 14:19:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 14:19:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:19:45,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:19:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 14:19:45,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 14:19:45,969 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:19:45,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:19:45 BoogieIcfgContainer [2018-11-18 14:19:45,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:19:45,970 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 14:19:45,970 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 14:19:45,972 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 14:19:45,973 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:19:45,973 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 02:19:45" (1/3) ... [2018-11-18 14:19:45,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cf21ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:19:45, skipping insertion in model container [2018-11-18 14:19:45,974 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:19:45,974 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:45" (2/3) ... [2018-11-18 14:19:45,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cf21ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:19:45, skipping insertion in model container [2018-11-18 14:19:45,975 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:19:45,975 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:19:45" (3/3) ... [2018-11-18 14:19:45,976 INFO L375 chiAutomizerObserver]: Analyzing ICFG invert_string_true-unreach-call_true-termination.i [2018-11-18 14:19:46,021 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:19:46,022 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 14:19:46,022 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 14:19:46,022 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 14:19:46,022 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:19:46,022 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:19:46,022 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 14:19:46,022 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:19:46,022 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 14:19:46,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-18 14:19:46,045 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-18 14:19:46,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:19:46,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:19:46,049 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:19:46,050 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:19:46,050 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 14:19:46,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-18 14:19:46,051 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-18 14:19:46,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:19:46,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:19:46,051 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:19:46,051 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:19:46,056 INFO L794 eck$LassoCheckResult]: Stem: 12#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~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 15#L16-4true [2018-11-18 14:19:46,056 INFO L796 eck$LassoCheckResult]: Loop: 15#L16-4true assume true; 3#L16-1true assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 19#L16-3true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 15#L16-4true [2018-11-18 14:19:46,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:46,060 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 14:19:46,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:46,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:46,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:46,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:19:46,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:46,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:46,145 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 14:19:46,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:46,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:46,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:46,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:19:46,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:46,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:46,162 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 14:19:46,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:46,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:46,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:46,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:19:46,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:46,402 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:19:46,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:19:46,403 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:19:46,403 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:19:46,403 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:19:46,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:19:46,403 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:19:46,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:19:46,404 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-18 14:19:46,404 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:19:46,404 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:19:46,423 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-18 14:19:46,428 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-18 14:19:46,430 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-18 14:19:46,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:19:46,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:19:46,438 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-18 14:19:46,444 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-18 14:19:46,448 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-18 14:19:46,497 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-18 14:19:46,499 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-18 14:19:46,500 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-18 14:19:46,502 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-18 14:19:46,504 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-18 14:19:46,505 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-18 14:19:46,730 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:19:46,733 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:19:46,735 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-18 14:19:46,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:46,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:46,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:46,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:46,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:19:46,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:19:46,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:46,747 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-18 14:19:46,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:46,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:19:46,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:46,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:46,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:46,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:19:46,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:19:46,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:46,751 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-18 14:19:46,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:46,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:19:46,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:46,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:46,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:46,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:19:46,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:19:46,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:46,754 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-18 14:19:46,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:46,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:19:46,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:46,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:46,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:46,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:19:46,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:19:46,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:46,757 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-18 14:19:46,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:46,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:19:46,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:46,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:46,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:46,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:19:46,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:19:46,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:46,764 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-18 14:19:46,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:46,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:19:46,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:46,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:46,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:46,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:19:46,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:19:46,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:46,766 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-18 14:19:46,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:46,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:46,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:46,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:46,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:19:46,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:19:46,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:46,775 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-18 14:19:46,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:46,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:19:46,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:46,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:46,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:46,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:19:46,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:19:46,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:46,780 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-18 14:19:46,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:46,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:46,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:46,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:46,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:19:46,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:19:46,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:46,795 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-18 14:19:46,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:46,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:46,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:46,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:46,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:19:46,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:19:46,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:46,802 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-18 14:19:46,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:46,803 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:19:46,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:46,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:46,805 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:19:46,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:19:46,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:46,811 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-18 14:19:46,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:46,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:19:46,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:46,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:46,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:46,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:19:46,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:19:46,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:46,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:19:46,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:46,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:46,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:46,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:46,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:19:46,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:19:46,853 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:19:46,872 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 14:19:46,872 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 14:19:46,883 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:19:46,884 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:19:46,885 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:19:46,885 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1, ULTIMATE.start_main_~#str1~0.offset) = -1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1 - 1*ULTIMATE.start_main_~#str1~0.offset Supporting invariants [] [2018-11-18 14:19:46,901 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 14:19:46,906 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 14:19:46,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:46,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:19:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:46,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:19:47,027 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-18 14:19:47,037 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-18 14:19:47,038 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 4 states. [2018-11-18 14:19:47,078 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 4 states. Result 39 states and 51 transitions. Complement of second has 8 states. [2018-11-18 14:19:47,080 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-18 14:19:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:19:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-18 14:19:47,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 14:19:47,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:19:47,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 14:19:47,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:19:47,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 14:19:47,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:19:47,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. [2018-11-18 14:19:47,085 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 14:19:47,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 18 states and 23 transitions. [2018-11-18 14:19:47,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 14:19:47,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-18 14:19:47,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-11-18 14:19:47,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:19:47,090 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-18 14:19:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-11-18 14:19:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 14:19:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 14:19:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-11-18 14:19:47,107 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-18 14:19:47,107 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-18 14:19:47,107 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 14:19:47,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2018-11-18 14:19:47,108 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 14:19:47,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:19:47,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:19:47,109 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 14:19:47,109 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:19:47,109 INFO L794 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 127#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 128#L16-4 assume true; 114#L16-1 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 115#L16-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 125#L24-4 [2018-11-18 14:19:47,109 INFO L796 eck$LassoCheckResult]: Loop: 125#L24-4 assume true; 126#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 129#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 125#L24-4 [2018-11-18 14:19:47,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:47,109 INFO L82 PathProgramCache]: Analyzing trace with hash 28694795, now seen corresponding path program 1 times [2018-11-18 14:19:47,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:47,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:47,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:47,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:19:47,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:47,247 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-18 14:19:47,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:19:47,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:19:47,250 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:19:47,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:47,250 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 1 times [2018-11-18 14:19:47,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:47,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:47,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:47,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:19:47,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:47,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:19:47,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:19:47,297 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-18 14:19:47,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:19:47,315 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-18 14:19:47,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:19:47,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2018-11-18 14:19:47,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 14:19:47,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 21 transitions. [2018-11-18 14:19:47,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 14:19:47,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 14:19:47,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2018-11-18 14:19:47,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:19:47,318 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-18 14:19:47,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2018-11-18 14:19:47,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-18 14:19:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 14:19:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-18 14:19:47,319 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-18 14:19:47,319 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-18 14:19:47,319 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 14:19:47,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-18 14:19:47,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 14:19:47,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:19:47,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:19:47,320 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-18 14:19:47,320 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:19:47,320 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 171#L16-4 assume true; 161#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 162#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 174#L16-4 assume true; 159#L16-1 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 160#L16-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 168#L24-4 [2018-11-18 14:19:47,321 INFO L796 eck$LassoCheckResult]: Loop: 168#L24-4 assume true; 169#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 172#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 168#L24-4 [2018-11-18 14:19:47,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:47,321 INFO L82 PathProgramCache]: Analyzing trace with hash 149879881, now seen corresponding path program 1 times [2018-11-18 14:19:47,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:47,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:47,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:47,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:19:47,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:47,450 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-18 14:19:47,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:19:47,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/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-18 14:19:47,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:19:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:47,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:19:47,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-18 14:19:47,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-11-18 14:19:47,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:19:47,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:19:47,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 14:19:47,574 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 14:19:47,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 14:19:47,591 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2018-11-18 14:19:47,645 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-18 14:19:47,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:19:47,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 14:19:47,661 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:19:47,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:47,661 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 2 times [2018-11-18 14:19:47,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:47,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:47,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:47,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:19:47,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:47,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:19:47,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:19:47,705 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-18 14:19:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:19:47,738 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-18 14:19:47,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:19:47,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-11-18 14:19:47,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 14:19:47,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 24 transitions. [2018-11-18 14:19:47,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 14:19:47,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 14:19:47,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2018-11-18 14:19:47,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:19:47,740 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-18 14:19:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2018-11-18 14:19:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-18 14:19:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 14:19:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-18 14:19:47,742 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-18 14:19:47,742 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-18 14:19:47,742 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 14:19:47,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2018-11-18 14:19:47,742 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 14:19:47,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:19:47,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:19:47,743 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2018-11-18 14:19:47,743 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:19:47,743 INFO L794 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 240#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 241#L16-4 assume true; 244#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 248#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 245#L16-4 assume true; 231#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 232#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 247#L16-4 assume true; 229#L16-1 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 230#L16-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 238#L24-4 [2018-11-18 14:19:47,743 INFO L796 eck$LassoCheckResult]: Loop: 238#L24-4 assume true; 239#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 242#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 238#L24-4 [2018-11-18 14:19:47,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1692719029, now seen corresponding path program 2 times [2018-11-18 14:19:47,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:47,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:47,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:47,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:47,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:19:48,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:19:48,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/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-18 14:19:48,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 14:19:48,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 14:19:48,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:19:48,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:19:48,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-18 14:19:48,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-11-18 14:19:48,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:19:48,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:19:48,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 14:19:48,089 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 14:19:48,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 14:19:48,101 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2018-11-18 14:19:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:19:48,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:19:48,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 14:19:48,208 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:19:48,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:48,208 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 3 times [2018-11-18 14:19:48,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:48,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:48,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:48,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:48,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:48,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:19:48,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 14:19:48,239 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-18 14:19:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:19:48,313 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-18 14:19:48,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:19:48,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-11-18 14:19:48,314 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 14:19:48,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 27 transitions. [2018-11-18 14:19:48,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 14:19:48,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 14:19:48,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2018-11-18 14:19:48,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:19:48,315 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-18 14:19:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2018-11-18 14:19:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-18 14:19:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 14:19:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-18 14:19:48,317 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-18 14:19:48,317 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-18 14:19:48,317 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 14:19:48,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2018-11-18 14:19:48,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 14:19:48,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:19:48,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:19:48,318 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1, 1] [2018-11-18 14:19:48,318 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:19:48,318 INFO L794 eck$LassoCheckResult]: Stem: 330#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 327#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 328#L16-4 assume true; 331#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 338#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 332#L16-4 assume true; 318#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 319#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 334#L16-4 assume true; 336#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 337#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 335#L16-4 assume true; 316#L16-1 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 317#L16-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 325#L24-4 [2018-11-18 14:19:48,318 INFO L796 eck$LassoCheckResult]: Loop: 325#L24-4 assume true; 326#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 329#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 325#L24-4 [2018-11-18 14:19:48,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:48,318 INFO L82 PathProgramCache]: Analyzing trace with hash -579836663, now seen corresponding path program 3 times [2018-11-18 14:19:48,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:48,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:48,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:48,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:48,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:19:48,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:19:48,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:19:48,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:19:48,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 14:19:48,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:19:48,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:19:48,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-18 14:19:48,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-11-18 14:19:48,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:19:48,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:19:48,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 14:19:48,526 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 14:19:48,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 14:19:48,533 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2018-11-18 14:19:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:19:48,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:19:48,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-11-18 14:19:48,648 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:19:48,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:48,648 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 4 times [2018-11-18 14:19:48,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:48,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:48,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:48,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:48,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:48,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:19:48,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-18 14:19:48,680 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-11-18 14:19:48,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:19:48,798 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-18 14:19:48,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:19:48,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2018-11-18 14:19:48,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 14:19:48,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 33 transitions. [2018-11-18 14:19:48,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 14:19:48,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 14:19:48,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2018-11-18 14:19:48,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:19:48,799 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-18 14:19:48,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2018-11-18 14:19:48,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-18 14:19:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 14:19:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-18 14:19:48,802 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 14:19:48,802 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 14:19:48,802 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 14:19:48,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2018-11-18 14:19:48,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 14:19:48,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:19:48,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:19:48,803 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1, 1] [2018-11-18 14:19:48,803 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:19:48,803 INFO L794 eck$LassoCheckResult]: Stem: 443#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 440#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 441#L16-4 assume true; 444#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 457#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 445#L16-4 assume true; 431#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 432#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 447#L16-4 assume true; 456#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 455#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 454#L16-4 assume true; 453#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 452#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 451#L16-4 assume true; 449#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 450#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 448#L16-4 assume true; 429#L16-1 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 430#L16-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 438#L24-4 [2018-11-18 14:19:48,803 INFO L796 eck$LassoCheckResult]: Loop: 438#L24-4 assume true; 439#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 442#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 438#L24-4 [2018-11-18 14:19:48,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:48,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1041220151, now seen corresponding path program 4 times [2018-11-18 14:19:48,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:48,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:48,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:48,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:48,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:48,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:48,822 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 5 times [2018-11-18 14:19:48,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:48,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:48,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:48,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:48,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:48,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:48,827 INFO L82 PathProgramCache]: Analyzing trace with hash -735685714, now seen corresponding path program 1 times [2018-11-18 14:19:48,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:48,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:48,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:48,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:48,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:49,628 WARN L180 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2018-11-18 14:19:50,124 WARN L180 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2018-11-18 14:19:50,126 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:19:50,126 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:19:50,126 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:19:50,126 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:19:50,126 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:19:50,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:19:50,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:19:50,126 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:19:50,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_true-unreach-call_true-termination.i_Iteration6_Lasso [2018-11-18 14:19:50,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:19:50,127 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:19:50,129 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-18 14:19:50,140 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-18 14:19:50,141 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-18 14:19:50,142 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-18 14:19:50,144 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-18 14:19:50,229 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-18 14:19:50,230 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-18 14:19:50,231 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-18 14:19:50,232 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-18 14:19:50,233 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-18 14:19:50,235 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-18 14:19:50,236 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-18 14:19:50,238 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-18 14:19:50,465 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:19:50,466 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:19:50,466 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-18 14:19:50,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:50,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:19:50,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:50,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:50,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:50,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:19:50,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:19:50,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:50,471 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-18 14:19:50,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:50,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:19:50,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:50,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:50,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:50,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:19:50,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:19:50,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:50,473 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-18 14:19:50,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:50,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:19:50,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:50,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:50,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:50,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:19:50,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:19:50,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:50,474 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-18 14:19:50,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:50,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:50,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:50,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:50,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:19:50,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:19:50,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:50,477 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-18 14:19:50,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:50,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:50,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:50,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:50,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:19:50,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:19:50,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:50,481 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-18 14:19:50,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:50,481 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:19:50,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:50,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:50,482 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:19:50,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:19:50,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:50,484 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-18 14:19:50,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:50,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:19:50,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:50,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:50,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:50,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:19:50,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:19:50,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:50,485 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-18 14:19:50,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:50,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:50,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:50,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:50,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:19:50,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:19:50,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:50,488 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-18 14:19:50,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:50,489 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:19:50,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:50,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:50,490 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:19:50,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:19:50,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:50,491 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-18 14:19:50,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:50,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:50,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:50,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:50,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:19:50,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:19:50,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:19:50,494 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-18 14:19:50,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:19:50,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:19:50,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:19:50,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:19:50,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:19:50,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:19:50,512 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:19:50,536 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-18 14:19:50,536 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 14:19:50,537 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:19:50,538 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:19:50,538 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:19:50,538 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_2) = 2*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_2 Supporting invariants [] [2018-11-18 14:19:50,651 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 14:19:50,652 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 14:19:50,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:50,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:19:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:50,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:19:50,694 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-18 14:19:50,695 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-18 14:19:50,695 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 31 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-18 14:19:50,761 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 31 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 33 states and 36 transitions. Complement of second has 7 states. [2018-11-18 14:19:50,764 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-18 14:19:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:19:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-18 14:19:50,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 20 letters. Loop has 3 letters. [2018-11-18 14:19:50,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:19:50,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 23 letters. Loop has 3 letters. [2018-11-18 14:19:50,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:19:50,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 20 letters. Loop has 6 letters. [2018-11-18 14:19:50,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:19:50,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2018-11-18 14:19:50,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 14:19:50,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 34 transitions. [2018-11-18 14:19:50,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 14:19:50,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 14:19:50,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 34 transitions. [2018-11-18 14:19:50,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:19:50,767 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-18 14:19:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 34 transitions. [2018-11-18 14:19:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 14:19:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 14:19:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-18 14:19:50,769 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-18 14:19:50,769 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-18 14:19:50,769 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 14:19:50,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 34 transitions. [2018-11-18 14:19:50,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 14:19:50,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:19:50,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:19:50,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:19:50,770 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:19:50,771 INFO L794 eck$LassoCheckResult]: Stem: 612#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 609#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 610#L16-4 assume true; 598#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 599#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 613#L16-4 assume true; 614#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 626#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 625#L16-4 assume true; 624#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 623#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 622#L16-4 assume true; 621#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 620#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 619#L16-4 assume true; 617#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 618#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 616#L16-4 assume true; 596#L16-1 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 597#L16-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 605#L24-4 assume true; 607#L24-1 assume !(main_~i~0 >= 0); 604#L24-5 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 600#L30-4 [2018-11-18 14:19:50,771 INFO L796 eck$LassoCheckResult]: Loop: 600#L30-4 assume true; 601#L30-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 603#L4 assume !(0 == __VERIFIER_assert_~cond); 615#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 602#L30-3 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 600#L30-4 [2018-11-18 14:19:50,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:50,771 INFO L82 PathProgramCache]: Analyzing trace with hash -735685772, now seen corresponding path program 1 times [2018-11-18 14:19:50,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:50,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:50,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:50,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:19:50,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:19:50,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:19:50,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:19:50,909 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:19:50,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:50,909 INFO L82 PathProgramCache]: Analyzing trace with hash 63145100, now seen corresponding path program 1 times [2018-11-18 14:19:50,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:50,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:50,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:50,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:19:50,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:51,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:19:51,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:19:51,027 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 14:19:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:19:51,052 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-18 14:19:51,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:19:51,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2018-11-18 14:19:51,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 14:19:51,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 34 transitions. [2018-11-18 14:19:51,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 14:19:51,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 14:19:51,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 34 transitions. [2018-11-18 14:19:51,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:19:51,054 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-18 14:19:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 34 transitions. [2018-11-18 14:19:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-18 14:19:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 14:19:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-18 14:19:51,056 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-18 14:19:51,056 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-18 14:19:51,056 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 14:19:51,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2018-11-18 14:19:51,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 14:19:51,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:19:51,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:19:51,057 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:19:51,058 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:19:51,058 INFO L794 eck$LassoCheckResult]: Stem: 685#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 682#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 683#L16-4 assume true; 671#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 672#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 686#L16-4 assume true; 687#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 699#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 698#L16-4 assume true; 697#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 696#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 695#L16-4 assume true; 694#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 693#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 692#L16-4 assume true; 690#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 691#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 689#L16-4 assume true; 669#L16-1 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 670#L16-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 678#L24-4 assume true; 679#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 684#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 680#L24-4 assume true; 681#L24-1 assume !(main_~i~0 >= 0); 677#L24-5 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 673#L30-4 [2018-11-18 14:19:51,058 INFO L796 eck$LassoCheckResult]: Loop: 673#L30-4 assume true; 674#L30-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 676#L4 assume !(0 == __VERIFIER_assert_~cond); 688#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 675#L30-3 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 673#L30-4 [2018-11-18 14:19:51,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:51,058 INFO L82 PathProgramCache]: Analyzing trace with hash 405026671, now seen corresponding path program 1 times [2018-11-18 14:19:51,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:51,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:51,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:51,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:19:51,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:19:51,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:19:51,145 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:19:51,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:19:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:51,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:19:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:19:51,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:19:51,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-18 14:19:51,268 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:19:51,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:51,269 INFO L82 PathProgramCache]: Analyzing trace with hash 63145100, now seen corresponding path program 2 times [2018-11-18 14:19:51,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:51,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:51,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:51,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:19:51,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:51,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 14:19:51,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:19:51,383 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-18 14:19:51,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:19:51,452 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-18 14:19:51,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:19:51,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 39 transitions. [2018-11-18 14:19:51,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 14:19:51,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 38 transitions. [2018-11-18 14:19:51,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 14:19:51,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 14:19:51,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2018-11-18 14:19:51,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:19:51,454 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-18 14:19:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2018-11-18 14:19:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-18 14:19:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 14:19:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-18 14:19:51,456 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-18 14:19:51,456 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-18 14:19:51,456 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 14:19:51,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 36 transitions. [2018-11-18 14:19:51,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 14:19:51,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:19:51,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:19:51,457 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 14:19:51,458 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:19:51,458 INFO L794 eck$LassoCheckResult]: Stem: 842#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 839#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 840#L16-4 assume true; 828#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 829#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 843#L16-4 assume true; 844#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 848#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 849#L16-4 assume true; 859#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 858#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 857#L16-4 assume true; 856#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 855#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 854#L16-4 assume true; 851#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 852#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 850#L16-4 assume true; 826#L16-1 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 827#L16-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 835#L24-4 assume true; 836#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 841#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 837#L24-4 assume true; 838#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 846#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 853#L24-4 assume true; 845#L24-1 assume !(main_~i~0 >= 0); 834#L24-5 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 830#L30-4 [2018-11-18 14:19:51,458 INFO L796 eck$LassoCheckResult]: Loop: 830#L30-4 assume true; 831#L30-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 833#L4 assume !(0 == __VERIFIER_assert_~cond); 847#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 832#L30-3 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 830#L30-4 [2018-11-18 14:19:51,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:51,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1588170132, now seen corresponding path program 2 times [2018-11-18 14:19:51,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:51,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:51,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:19:51,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:19:51,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:19:51,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 14:19:51,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 14:19:51,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:19:51,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:19:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:19:51,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:19:51,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-18 14:19:51,651 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:19:51,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:51,651 INFO L82 PathProgramCache]: Analyzing trace with hash 63145100, now seen corresponding path program 3 times [2018-11-18 14:19:51,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:51,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:51,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:51,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:51,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:51,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:19:51,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-18 14:19:51,736 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-11-18 14:19:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:19:51,842 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-18 14:19:51,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:19:51,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 42 transitions. [2018-11-18 14:19:51,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 14:19:51,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 41 transitions. [2018-11-18 14:19:51,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 14:19:51,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 14:19:51,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2018-11-18 14:19:51,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:19:51,845 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-18 14:19:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2018-11-18 14:19:51,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-18 14:19:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 14:19:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-18 14:19:51,847 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-18 14:19:51,847 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-18 14:19:51,847 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 14:19:51,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 39 transitions. [2018-11-18 14:19:51,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 14:19:51,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:19:51,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:19:51,849 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-18 14:19:51,849 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:19:51,849 INFO L794 eck$LassoCheckResult]: Stem: 1023#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1019#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1020#L16-4 assume true; 1024#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1028#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1025#L16-4 assume true; 1008#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1009#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1041#L16-4 assume true; 1040#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1039#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1038#L16-4 assume true; 1037#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1036#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1034#L16-4 assume true; 1030#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1031#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1029#L16-4 assume true; 1006#L16-1 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1007#L16-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 1015#L24-4 assume true; 1016#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1042#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1017#L24-4 assume true; 1018#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1021#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1022#L24-4 assume true; 1033#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1035#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1032#L24-4 assume true; 1026#L24-1 assume !(main_~i~0 >= 0); 1014#L24-5 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 1010#L30-4 [2018-11-18 14:19:51,849 INFO L796 eck$LassoCheckResult]: Loop: 1010#L30-4 assume true; 1011#L30-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1013#L4 assume !(0 == __VERIFIER_assert_~cond); 1027#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 1012#L30-3 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 1010#L30-4 [2018-11-18 14:19:51,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:51,850 INFO L82 PathProgramCache]: Analyzing trace with hash -181581489, now seen corresponding path program 3 times [2018-11-18 14:19:51,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:51,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:51,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:51,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:19:52,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:19:52,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:19:52,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:19:52,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 14:19:52,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:19:52,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:19:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:19:52,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:19:52,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-18 14:19:52,211 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:19:52,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:52,211 INFO L82 PathProgramCache]: Analyzing trace with hash 63145100, now seen corresponding path program 4 times [2018-11-18 14:19:52,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:52,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:52,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:52,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:52,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:52,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 14:19:52,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:19:52,288 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. cyclomatic complexity: 5 Second operand 13 states. [2018-11-18 14:19:52,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:19:52,406 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-18 14:19:52,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 14:19:52,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 45 transitions. [2018-11-18 14:19:52,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 14:19:52,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 44 transitions. [2018-11-18 14:19:52,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 14:19:52,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 14:19:52,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2018-11-18 14:19:52,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:19:52,409 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-18 14:19:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2018-11-18 14:19:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-18 14:19:52,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 14:19:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-18 14:19:52,411 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-18 14:19:52,411 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-18 14:19:52,411 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 14:19:52,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 42 transitions. [2018-11-18 14:19:52,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 14:19:52,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:19:52,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:19:52,412 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-11-18 14:19:52,412 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:19:52,412 INFO L794 eck$LassoCheckResult]: Stem: 1222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1219#L16-4 assume true; 1207#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1208#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1223#L16-4 assume true; 1224#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1227#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1228#L16-4 assume true; 1240#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1239#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1238#L16-4 assume true; 1237#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1236#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1234#L16-4 assume true; 1230#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1231#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1229#L16-4 assume true; 1205#L16-1 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1206#L16-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 1214#L24-4 assume true; 1215#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1244#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1216#L24-4 assume true; 1217#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1220#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1221#L24-4 assume true; 1243#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1242#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1241#L24-4 assume true; 1233#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1235#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1232#L24-4 assume true; 1225#L24-1 assume !(main_~i~0 >= 0); 1213#L24-5 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 1209#L30-4 [2018-11-18 14:19:52,413 INFO L796 eck$LassoCheckResult]: Loop: 1209#L30-4 assume true; 1210#L30-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1212#L4 assume !(0 == __VERIFIER_assert_~cond); 1226#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 1211#L30-3 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 1209#L30-4 [2018-11-18 14:19:52,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:52,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2128564300, now seen corresponding path program 4 times [2018-11-18 14:19:52,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:52,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:52,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:52,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:52,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:19:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:19:52,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:19:52,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a80c847-f8c6-41d7-b57b-8d501fbaa602/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:19:52,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 14:19:52,607 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 14:19:52,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:19:52,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:19:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:19:52,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:19:52,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-18 14:19:52,714 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:19:52,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:52,714 INFO L82 PathProgramCache]: Analyzing trace with hash 63145100, now seen corresponding path program 5 times [2018-11-18 14:19:52,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:52,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:52,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:52,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:52,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:52,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 14:19:52,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-11-18 14:19:52,801 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. cyclomatic complexity: 5 Second operand 16 states. [2018-11-18 14:19:53,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:19:53,179 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-18 14:19:53,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 14:19:53,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 67 transitions. [2018-11-18 14:19:53,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 14:19:53,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 66 transitions. [2018-11-18 14:19:53,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 14:19:53,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-18 14:19:53,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 66 transitions. [2018-11-18 14:19:53,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:19:53,181 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-11-18 14:19:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 66 transitions. [2018-11-18 14:19:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 43. [2018-11-18 14:19:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 14:19:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-18 14:19:53,183 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-18 14:19:53,183 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-18 14:19:53,183 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 14:19:53,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 45 transitions. [2018-11-18 14:19:53,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 14:19:53,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:19:53,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:19:53,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-18 14:19:53,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:19:53,185 INFO L794 eck$LassoCheckResult]: Stem: 1470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1466#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem3, main_#t~post4, main_#t~post2, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~post5, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1467#L16-4 assume true; 1455#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1456#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1471#L16-4 assume true; 1472#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1489#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1487#L16-4 assume true; 1486#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1485#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1484#L16-4 assume true; 1483#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1481#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1478#L16-4 assume true; 1476#L16-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1477#L16-3 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1475#L16-4 assume true; 1453#L16-1 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1454#L16-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 1462#L24-4 assume true; 1463#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1495#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1464#L24-4 assume true; 1465#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1468#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1469#L24-4 assume true; 1494#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1493#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1492#L24-4 assume true; 1491#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1490#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1488#L24-4 assume true; 1480#L24-1 assume !!(main_~i~0 >= 0);call main_#t~mem3 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem3, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem3;main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1482#L24-3 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1479#L24-4 assume true; 1473#L24-1 assume !(main_~i~0 >= 0); 1461#L24-5 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 1457#L30-4 [2018-11-18 14:19:53,185 INFO L796 eck$LassoCheckResult]: Loop: 1457#L30-4 assume true; 1458#L30-1 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem6 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem7 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem6 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1460#L4 assume !(0 == __VERIFIER_assert_~cond); 1474#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 1459#L30-3 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 1457#L30-4 [2018-11-18 14:19:53,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:53,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1160154321, now seen corresponding path program 5 times [2018-11-18 14:19:53,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:53,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:53,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:53,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:53,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:53,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:53,237 INFO L82 PathProgramCache]: Analyzing trace with hash 63145100, now seen corresponding path program 6 times [2018-11-18 14:19:53,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:53,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:53,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:53,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:53,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:53,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:19:53,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1269244386, now seen corresponding path program 1 times [2018-11-18 14:19:53,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:19:53,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:19:53,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:53,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:19:53,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:19:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:19:58,056 WARN L180 SmtUtils]: Spent 4.66 s on a formula simplification. DAG size of input: 266 DAG size of output: 199 [2018-11-18 14:19:59,573 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 155 DAG size of output: 110 [2018-11-18 14:19:59,575 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:19:59,575 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:19:59,575 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:19:59,575 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:19:59,576 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:19:59,576 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:19:59,576 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:19:59,576 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:19:59,576 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-18 14:19:59,576 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:19:59,576 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:19:59,579 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-18 14:19:59,580 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-18 14:19:59,582 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-18 14:19:59,584 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-18 14:19:59,588 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-18 14:19:59,592 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-18 14:19:59,593 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-18 14:19:59,595 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-18 14:19:59,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:19:59,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:19:59,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:19:59,737 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 14:19:59,739 INFO L168 Benchmark]: Toolchain (without parser) took 14203.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.2 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -82.1 MB). Peak memory consumption was 269.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:19:59,740 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:19:59,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.31 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:19:59,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.40 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:19:59,740 INFO L168 Benchmark]: Boogie Preprocessor took 52.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -217.8 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:19:59,741 INFO L168 Benchmark]: RCFGBuilder took 186.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:19:59,741 INFO L168 Benchmark]: BuchiAutomizer took 13768.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.9 MB). Peak memory consumption was 292.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:19:59,743 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.31 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.40 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -217.8 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 186.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13768.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.9 MB). Peak memory consumption was 292.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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...