./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/invert_string-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/invert_string-3.c -s /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac7c62eef1736762a9ed0f43546ad9c2b468346f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/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.24-cad4683 [2019-10-22 08:56:41,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:41,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:41,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:41,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:41,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:41,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:41,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:41,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:41,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:41,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:41,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:41,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:41,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:41,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:41,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:41,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:41,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:41,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:41,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:41,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:41,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:41,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:41,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:41,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:41,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:41,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:41,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:41,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:41,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:41,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:41,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:41,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:41,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:41,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:41,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:41,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:41,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:41,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:41,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:41,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:41,595 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:56:41,612 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:41,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:41,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:41,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:41,627 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:41,627 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:41,627 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:41,628 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:41,628 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:41,628 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:41,628 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:41,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:41,629 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:56:41,629 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:41,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:41,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:56:41,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:41,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:41,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:41,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:41,631 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:56:41,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:41,631 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:41,631 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:41,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:41,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:41,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:41,632 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:41,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:41,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:41,633 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:41,634 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:41,634 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac7c62eef1736762a9ed0f43546ad9c2b468346f [2019-10-22 08:56:41,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:41,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:41,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:41,692 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:41,692 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:41,693 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/../../sv-benchmarks/c/loops/invert_string-3.c [2019-10-22 08:56:41,740 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/data/1f9b48f8e/dc6a8a24a8b74168a211ef37d3509f57/FLAG93564ba06 [2019-10-22 08:56:42,129 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:42,129 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/sv-benchmarks/c/loops/invert_string-3.c [2019-10-22 08:56:42,133 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/data/1f9b48f8e/dc6a8a24a8b74168a211ef37d3509f57/FLAG93564ba06 [2019-10-22 08:56:42,144 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/data/1f9b48f8e/dc6a8a24a8b74168a211ef37d3509f57 [2019-10-22 08:56:42,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:42,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:42,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:42,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:42,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:42,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:42" (1/1) ... [2019-10-22 08:56:42,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f20cdb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:42, skipping insertion in model container [2019-10-22 08:56:42,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:42" (1/1) ... [2019-10-22 08:56:42,161 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:42,179 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:42,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:42,367 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:42,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:42,510 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:42,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:42 WrapperNode [2019-10-22 08:56:42,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:42,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:42,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:42,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:42,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:42" (1/1) ... [2019-10-22 08:56:42,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:42" (1/1) ... [2019-10-22 08:56:42,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:42,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:42,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:42,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:42,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:42" (1/1) ... [2019-10-22 08:56:42,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:42" (1/1) ... [2019-10-22 08:56:42,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:42" (1/1) ... [2019-10-22 08:56:42,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:42" (1/1) ... [2019-10-22 08:56:42,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:42" (1/1) ... [2019-10-22 08:56:42,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:42" (1/1) ... [2019-10-22 08:56:42,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:42" (1/1) ... [2019-10-22 08:56:42,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:42,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:42,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:42,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:42,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:42,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:42,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:42,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:42,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:42,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:42,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:42,858 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:42,858 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 08:56:42,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:42 BoogieIcfgContainer [2019-10-22 08:56:42,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:42,860 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:42,860 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:42,864 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:42,865 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:42,866 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:42" (1/3) ... [2019-10-22 08:56:42,867 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a77438e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:42, skipping insertion in model container [2019-10-22 08:56:42,867 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:42,867 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:42" (2/3) ... [2019-10-22 08:56:42,868 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a77438e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:42, skipping insertion in model container [2019-10-22 08:56:42,868 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:42,868 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:42" (3/3) ... [2019-10-22 08:56:42,870 INFO L371 chiAutomizerObserver]: Analyzing ICFG invert_string-3.c [2019-10-22 08:56:42,959 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:42,970 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:42,970 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:42,970 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:42,974 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:42,974 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:42,974 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:42,974 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:42,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:56:43,039 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:56:43,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:43,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:43,062 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:43,063 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:43,063 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:43,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:56:43,064 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:56:43,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:43,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:43,065 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:43,065 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:43,072 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true 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.allocOnStack((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.allocOnStack((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; 16#L16-3true [2019-10-22 08:56:43,072 INFO L793 eck$LassoCheckResult]: Loop: 16#L16-3true 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; 18#L16-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 16#L16-3true [2019-10-22 08:56:43,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:43,079 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:56:43,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:43,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265398248] [2019-10-22 08:56:43,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:43,228 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:43,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:43,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-10-22 08:56:43,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:43,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86050110] [2019-10-22 08:56:43,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:43,263 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:43,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:43,266 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-10-22 08:56:43,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:43,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354891616] [2019-10-22 08:56:43,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:43,331 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:43,582 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-10-22 08:56:43,593 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:43,593 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:43,594 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:43,594 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:43,594 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:43,594 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:43,594 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:43,594 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:43,595 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration1_Lasso [2019-10-22 08:56:43,595 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:43,595 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:43,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,035 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:44,040 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:44,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,043 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,044 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,044 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,045 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,047 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,048 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,058 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:44,058 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:44,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,069 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,070 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,070 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,079 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,080 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,088 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,089 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,089 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,092 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:44,092 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:44,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,097 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,097 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,097 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,097 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,097 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,098 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,098 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,100 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,100 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,102 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:44,103 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:44,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,113 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:44,114 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:44,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,117 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,117 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,117 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,118 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,119 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,121 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:56:44,121 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,121 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,124 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:56:44,124 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:44,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,148 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,148 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,154 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:44,154 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:44,227 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:44,257 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:56:44,257 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:56:44,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:44,261 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:44,261 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:44,262 INFO L512 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 [] [2019-10-22 08:56:44,281 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:56:44,289 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:56:44,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:44,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:44,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:44,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:44,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:44,382 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 [2019-10-22 08:56:44,383 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-10-22 08:56:44,436 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 8 states. [2019-10-22 08:56:44,440 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 [2019-10-22 08:56:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-10-22 08:56:44,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2019-10-22 08:56:44,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:44,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:56:44,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:44,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2019-10-22 08:56:44,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:44,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2019-10-22 08:56:44,449 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:56:44,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2019-10-22 08:56:44,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:44,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:56:44,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-10-22 08:56:44,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:44,455 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:56:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-10-22 08:56:44,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-22 08:56:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:56:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-10-22 08:56:44,479 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:56:44,480 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:56:44,480 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:44,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-10-22 08:56:44,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:56:44,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:44,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:44,481 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:56:44,482 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:44,482 INFO L791 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 108#L-1 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.allocOnStack((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.allocOnStack((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; 109#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 113#L16-4 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); 110#L24-3 [2019-10-22 08:56:44,482 INFO L793 eck$LassoCheckResult]: Loop: 110#L24-3 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; 111#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 110#L24-3 [2019-10-22 08:56:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:44,483 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-10-22 08:56:44,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:44,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442241946] [2019-10-22 08:56:44,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:44,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:44,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:44,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442241946] [2019-10-22 08:56:44,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:44,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:44,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184590923] [2019-10-22 08:56:44,661 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:44,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:44,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2019-10-22 08:56:44,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:44,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558636700] [2019-10-22 08:56:44,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:44,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:44,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:44,680 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:44,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:44,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:44,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:44,752 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 08:56:44,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:44,786 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-10-22 08:56:44,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:44,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-10-22 08:56:44,788 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:44,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2019-10-22 08:56:44,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:44,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:44,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-10-22 08:56:44,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:44,789 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-10-22 08:56:44,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-10-22 08:56:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-10-22 08:56:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:56:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-10-22 08:56:44,793 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-10-22 08:56:44,793 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-10-22 08:56:44,793 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:44,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2019-10-22 08:56:44,794 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:44,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:44,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:44,795 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:56:44,795 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:44,795 INFO L791 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 137#L-1 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.allocOnStack((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.allocOnStack((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; 138#L16-3 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; 148#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 149#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 146#L16-4 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); 139#L24-3 [2019-10-22 08:56:44,795 INFO L793 eck$LassoCheckResult]: Loop: 139#L24-3 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; 141#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 139#L24-3 [2019-10-22 08:56:44,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:44,795 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-10-22 08:56:44,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:44,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661554691] [2019-10-22 08:56:44,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:44,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:44,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:44,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661554691] [2019-10-22 08:56:44,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724910078] [2019-10-22 08:56:44,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:44,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:56:44,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:44,973 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_1, |v_#length_28|], 1=[|v_#valid_41|]} [2019-10-22 08:56:44,983 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-22 08:56:44,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:45,009 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-10-22 08:56:45,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:56:45,025 INFO L375 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2019-10-22 08:56:45,028 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:45,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:45,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-22 08:56:45,048 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:45,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:45,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:45,061 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2019-10-22 08:56:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:45,115 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:45,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-22 08:56:45,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679510443] [2019-10-22 08:56:45,116 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:45,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2019-10-22 08:56:45,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81138506] [2019-10-22 08:56:45,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,133 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:45,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:45,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:45,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:45,184 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-10-22 08:56:45,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:45,269 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-10-22 08:56:45,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:45,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2019-10-22 08:56:45,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:45,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2019-10-22 08:56:45,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:45,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:45,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2019-10-22 08:56:45,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:45,271 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-10-22 08:56:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2019-10-22 08:56:45,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-22 08:56:45,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:56:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-10-22 08:56:45,273 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-22 08:56:45,273 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-22 08:56:45,273 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:56:45,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-10-22 08:56:45,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:45,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:45,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:45,274 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-10-22 08:56:45,275 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:45,275 INFO L791 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 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.allocOnStack((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.allocOnStack((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; 191#L16-3 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; 201#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 202#L16-3 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; 203#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 204#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 198#L16-4 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); 192#L24-3 [2019-10-22 08:56:45,275 INFO L793 eck$LassoCheckResult]: Loop: 192#L24-3 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; 194#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 192#L24-3 [2019-10-22 08:56:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,275 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-10-22 08:56:45,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10347080] [2019-10-22 08:56:45,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:45,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10347080] [2019-10-22 08:56:45,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820942358] [2019-10-22 08:56:45,381 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:45,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:56:45,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:45,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:56:45,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:45,470 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:45,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-10-22 08:56:45,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226599603] [2019-10-22 08:56:45,471 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:45,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2019-10-22 08:56:45,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535628704] [2019-10-22 08:56:45,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,490 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:45,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:45,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:56:45,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:45,546 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-10-22 08:56:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:45,620 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-10-22 08:56:45,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:45,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-10-22 08:56:45,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:45,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2019-10-22 08:56:45,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:45,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:45,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2019-10-22 08:56:45,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:45,623 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-22 08:56:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2019-10-22 08:56:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-10-22 08:56:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:56:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-22 08:56:45,624 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-22 08:56:45,625 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-22 08:56:45,625 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:56:45,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-10-22 08:56:45,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:45,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:45,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:45,626 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-10-22 08:56:45,626 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:45,627 INFO L791 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 255#L-1 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.allocOnStack((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.allocOnStack((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; 256#L16-3 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; 266#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 267#L16-3 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; 268#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 271#L16-3 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; 270#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 269#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 263#L16-4 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); 257#L24-3 [2019-10-22 08:56:45,627 INFO L793 eck$LassoCheckResult]: Loop: 257#L24-3 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; 259#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 257#L24-3 [2019-10-22 08:56:45,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-10-22 08:56:45,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684289485] [2019-10-22 08:56:45,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:46,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684289485] [2019-10-22 08:56:46,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056067293] [2019-10-22 08:56:46,131 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:46,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-22 08:56:46,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:46,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-22 08:56:46,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:46,208 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|, v_prenex_2], 1=[|v_#valid_44|]} [2019-10-22 08:56:46,212 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-22 08:56:46,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:46,234 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-10-22 08:56:46,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:56:46,242 INFO L375 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2019-10-22 08:56:46,242 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:46,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:46,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-22 08:56:46,265 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:46,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:46,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:46,281 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2019-10-22 08:56:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:46,449 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:46,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-10-22 08:56:46,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786337272] [2019-10-22 08:56:46,449 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:46,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:46,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2019-10-22 08:56:46,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:46,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236066754] [2019-10-22 08:56:46,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:46,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:46,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:46,461 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:46,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:46,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:56:46,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:56:46,513 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand 12 states. [2019-10-22 08:56:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:46,650 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-10-22 08:56:46,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:46,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-10-22 08:56:46,651 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:46,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-10-22 08:56:46,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:46,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:46,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-10-22 08:56:46,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:46,652 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-22 08:56:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-10-22 08:56:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-10-22 08:56:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 08:56:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-22 08:56:46,654 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-22 08:56:46,654 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-22 08:56:46,654 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:56:46,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2019-10-22 08:56:46,655 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:46,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:46,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:46,655 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-10-22 08:56:46,655 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:46,656 INFO L791 eck$LassoCheckResult]: Stem: 339#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 334#L-1 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.allocOnStack((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.allocOnStack((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; 335#L16-3 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; 345#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 346#L16-3 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; 347#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 348#L16-3 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; 352#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 351#L16-3 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; 350#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 349#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 342#L16-4 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); 336#L24-3 [2019-10-22 08:56:46,656 INFO L793 eck$LassoCheckResult]: Loop: 336#L24-3 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; 338#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 336#L24-3 [2019-10-22 08:56:46,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:46,656 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-10-22 08:56:46,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:46,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394717186] [2019-10-22 08:56:46,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:46,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:46,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:47,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394717186] [2019-10-22 08:56:47,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248389078] [2019-10-22 08:56:47,138 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:47,175 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 08:56:47,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:47,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 08:56:47,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:47,266 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:47,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-10-22 08:56:47,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637115965] [2019-10-22 08:56:47,267 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:47,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:47,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2019-10-22 08:56:47,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:47,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640589185] [2019-10-22 08:56:47,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:47,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:47,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:47,284 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:47,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:47,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 08:56:47,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:56:47,321 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand 14 states. [2019-10-22 08:56:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:47,693 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-10-22 08:56:47,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:56:47,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2019-10-22 08:56:47,694 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:47,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2019-10-22 08:56:47,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:47,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:47,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2019-10-22 08:56:47,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:47,695 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-22 08:56:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2019-10-22 08:56:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-22 08:56:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:56:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-22 08:56:47,697 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-22 08:56:47,697 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-22 08:56:47,697 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:56:47,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2019-10-22 08:56:47,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:47,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:47,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:47,698 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-10-22 08:56:47,698 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:47,699 INFO L791 eck$LassoCheckResult]: Stem: 440#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 435#L-1 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.allocOnStack((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.allocOnStack((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; 436#L16-3 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; 446#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 447#L16-3 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; 448#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 449#L16-3 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-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 454#L16-3 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; 453#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 452#L16-3 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; 451#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 450#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 443#L16-4 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); 437#L24-3 [2019-10-22 08:56:47,699 INFO L793 eck$LassoCheckResult]: Loop: 437#L24-3 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; 439#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 437#L24-3 [2019-10-22 08:56:47,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:47,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-10-22 08:56:47,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:47,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086914752] [2019-10-22 08:56:47,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:47,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:47,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:47,736 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:47,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:47,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2019-10-22 08:56:47,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:47,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143961703] [2019-10-22 08:56:47,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:47,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:47,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:47,743 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2019-10-22 08:56:47,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:47,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851579937] [2019-10-22 08:56:47,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:47,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:47,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:47,790 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:48,887 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 150 DAG size of output: 121 [2019-10-22 08:56:49,432 WARN L191 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-10-22 08:56:49,434 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:49,434 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:49,434 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:49,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:49,435 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:49,435 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:49,435 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:49,435 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:49,435 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration7_Lasso [2019-10-22 08:56:49,435 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:49,435 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:49,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:49,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:49,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:49,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:49,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:49,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:49,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:49,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:49,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:49,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:49,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:49,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:49,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:49,691 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-22 08:56:49,880 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:49,880 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:49,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:49,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:49,881 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:49,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:49,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:49,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:49,882 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:49,882 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:49,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:49,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:49,885 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:49,885 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:49,885 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:49,885 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:49,885 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:49,885 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:49,886 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:49,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:49,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:49,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:49,887 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:49,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:49,888 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:49,888 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:49,888 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:49,888 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:49,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:49,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:49,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:49,889 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:49,889 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:49,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:49,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:49,890 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:49,891 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:49,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:49,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:49,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:49,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:49,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:49,892 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:49,893 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:49,893 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:49,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:49,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:49,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:49,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:49,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:49,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:49,898 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:49,898 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:49,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:49,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:49,902 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:49,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:49,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:49,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:49,905 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:49,905 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:49,938 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:49,967 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:56:49,967 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:56:49,967 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:49,968 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:49,969 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:49,969 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2019-10-22 08:56:49,976 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:56:49,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:50,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:50,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:50,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:50,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:50,022 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 [2019-10-22 08:56:50,022 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:56:50,035 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 7 states. [2019-10-22 08:56:50,036 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 [2019-10-22 08:56:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-10-22 08:56:50,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2019-10-22 08:56:50,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:50,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 16 letters. Loop has 2 letters. [2019-10-22 08:56:50,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:50,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 14 letters. Loop has 4 letters. [2019-10-22 08:56:50,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:50,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-10-22 08:56:50,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:50,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 25 transitions. [2019-10-22 08:56:50,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:56:50,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:56:50,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-10-22 08:56:50,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:50,040 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-22 08:56:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-10-22 08:56:50,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-22 08:56:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 08:56:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-22 08:56:50,042 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-22 08:56:50,042 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-22 08:56:50,042 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:56:50,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2019-10-22 08:56:50,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:50,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:50,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:50,043 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:50,043 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:56:50,044 INFO L791 eck$LassoCheckResult]: Stem: 570#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 564#L-1 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.allocOnStack((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.allocOnStack((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; 565#L16-3 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; 576#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 577#L16-3 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; 578#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 579#L16-3 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; 585#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 584#L16-3 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; 583#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 582#L16-3 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; 581#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 580#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 574#L16-4 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); 566#L24-3 assume !(main_~i~0 >= 0); 567#L24-4 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; 571#L30-3 [2019-10-22 08:56:50,044 INFO L793 eck$LassoCheckResult]: Loop: 571#L30-3 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);__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; 572#L4 assume !(0 == __VERIFIER_assert_~cond); 575#L4-2 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; 573#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 571#L30-3 [2019-10-22 08:56:50,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:50,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425437, now seen corresponding path program 1 times [2019-10-22 08:56:50,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:50,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187262117] [2019-10-22 08:56:50,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:50,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187262117] [2019-10-22 08:56:50,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143662952] [2019-10-22 08:56:50,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:50,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:50,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:50,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:50,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:50,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:50,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:50,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 08:56:50,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:56:50,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-10-22 08:56:50,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465335300] [2019-10-22 08:56:50,649 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:50,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:50,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 1 times [2019-10-22 08:56:50,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:50,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109889017] [2019-10-22 08:56:50,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:50,658 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:50,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:50,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:50,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:56:50,740 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-10-22 08:56:50,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:50,770 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-10-22 08:56:50,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:50,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2019-10-22 08:56:50,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:50,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2019-10-22 08:56:50,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:56:50,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:56:50,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2019-10-22 08:56:50,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:50,772 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-22 08:56:50,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2019-10-22 08:56:50,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-22 08:56:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 08:56:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-22 08:56:50,774 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-22 08:56:50,774 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-22 08:56:50,774 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:56:50,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-10-22 08:56:50,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:50,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:50,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:50,775 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:50,775 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:56:50,775 INFO L791 eck$LassoCheckResult]: Stem: 675#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 669#L-1 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.allocOnStack((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.allocOnStack((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; 670#L16-3 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; 681#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 682#L16-3 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; 683#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 684#L16-3 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; 690#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 689#L16-3 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; 688#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 687#L16-3 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; 686#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 685#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 678#L16-4 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); 671#L24-3 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; 672#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 673#L24-3 assume !(main_~i~0 >= 0); 674#L24-4 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; 676#L30-3 [2019-10-22 08:56:50,775 INFO L793 eck$LassoCheckResult]: Loop: 676#L30-3 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);__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; 677#L4 assume !(0 == __VERIFIER_assert_~cond); 680#L4-2 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; 679#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 676#L30-3 [2019-10-22 08:56:50,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:50,775 INFO L82 PathProgramCache]: Analyzing trace with hash -743540257, now seen corresponding path program 1 times [2019-10-22 08:56:50,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:50,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384079741] [2019-10-22 08:56:50,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 08:56:50,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384079741] [2019-10-22 08:56:50,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740043198] [2019-10-22 08:56:50,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:50,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:56:50,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 08:56:50,967 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:50,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-22 08:56:50,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179269796] [2019-10-22 08:56:50,968 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:50,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:50,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 2 times [2019-10-22 08:56:50,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:50,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111035605] [2019-10-22 08:56:50,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:50,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:50,976 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:51,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:51,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:56:51,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:56:51,065 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 5 Second operand 9 states. [2019-10-22 08:56:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:51,139 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-10-22 08:56:51,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:51,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2019-10-22 08:56:51,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:51,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2019-10-22 08:56:51,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:56:51,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:56:51,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2019-10-22 08:56:51,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:51,141 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-22 08:56:51,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2019-10-22 08:56:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-22 08:56:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:56:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-22 08:56:51,143 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-22 08:56:51,143 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-22 08:56:51,143 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:56:51,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2019-10-22 08:56:51,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:51,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:51,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:51,144 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:51,144 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:56:51,145 INFO L791 eck$LassoCheckResult]: Stem: 791#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 785#L-1 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.allocOnStack((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.allocOnStack((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; 786#L16-3 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; 798#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 799#L16-3 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; 800#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 808#L16-3 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; 807#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 806#L16-3 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; 805#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 804#L16-3 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; 803#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 802#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 795#L16-4 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); 787#L24-3 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; 788#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 789#L24-3 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; 790#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 794#L24-3 assume !(main_~i~0 >= 0); 801#L24-4 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; 792#L30-3 [2019-10-22 08:56:51,145 INFO L793 eck$LassoCheckResult]: Loop: 792#L30-3 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);__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; 793#L4 assume !(0 == __VERIFIER_assert_~cond); 797#L4-2 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; 796#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 792#L30-3 [2019-10-22 08:56:51,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:51,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1577559391, now seen corresponding path program 2 times [2019-10-22 08:56:51,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:51,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038628710] [2019-10-22 08:56:51,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 08:56:51,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038628710] [2019-10-22 08:56:51,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613166691] [2019-10-22 08:56:51,251 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:51,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:56:51,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:51,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 08:56:51,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 08:56:51,343 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:51,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-22 08:56:51,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404393271] [2019-10-22 08:56:51,344 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:51,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:51,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 3 times [2019-10-22 08:56:51,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:51,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202950896] [2019-10-22 08:56:51,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:51,352 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:51,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:51,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:56:51,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:56:51,465 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 5 Second operand 11 states. [2019-10-22 08:56:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:51,608 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-10-22 08:56:51,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:56:51,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2019-10-22 08:56:51,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:51,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 29 transitions. [2019-10-22 08:56:51,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:56:51,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:56:51,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2019-10-22 08:56:51,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:51,610 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-22 08:56:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2019-10-22 08:56:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-10-22 08:56:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 08:56:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-10-22 08:56:51,612 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-10-22 08:56:51,612 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-10-22 08:56:51,612 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 08:56:51,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2019-10-22 08:56:51,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:51,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:51,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:51,613 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:51,613 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:56:51,613 INFO L791 eck$LassoCheckResult]: Stem: 921#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 915#L-1 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.allocOnStack((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.allocOnStack((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; 916#L16-3 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; 928#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 929#L16-3 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; 930#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 939#L16-3 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; 938#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 936#L16-3 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; 935#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 934#L16-3 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; 933#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 932#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 926#L16-4 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); 917#L24-3 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; 918#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 940#L24-3 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; 924#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 919#L24-3 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; 920#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 937#L24-3 assume !(main_~i~0 >= 0); 931#L24-4 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; 922#L30-3 [2019-10-22 08:56:51,613 INFO L793 eck$LassoCheckResult]: Loop: 922#L30-3 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);__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; 923#L4 assume !(0 == __VERIFIER_assert_~cond); 927#L4-2 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; 925#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 922#L30-3 [2019-10-22 08:56:51,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:51,613 INFO L82 PathProgramCache]: Analyzing trace with hash 88937187, now seen corresponding path program 3 times [2019-10-22 08:56:51,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:51,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368449191] [2019-10-22 08:56:51,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:51,747 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 08:56:51,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368449191] [2019-10-22 08:56:51,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813599958] [2019-10-22 08:56:51,747 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:51,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-22 08:56:51,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:51,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:56:51,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 08:56:51,888 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:51,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-10-22 08:56:51,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000539493] [2019-10-22 08:56:51,889 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:51,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:51,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 4 times [2019-10-22 08:56:51,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:51,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903842319] [2019-10-22 08:56:51,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:51,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:51,897 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:52,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:52,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 08:56:52,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:56:52,004 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 5 Second operand 13 states. [2019-10-22 08:56:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:52,200 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-10-22 08:56:52,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:56:52,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2019-10-22 08:56:52,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:52,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 31 transitions. [2019-10-22 08:56:52,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:56:52,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:56:52,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 31 transitions. [2019-10-22 08:56:52,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:52,202 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-22 08:56:52,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 31 transitions. [2019-10-22 08:56:52,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-22 08:56:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 08:56:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-10-22 08:56:52,203 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-22 08:56:52,203 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-22 08:56:52,204 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 08:56:52,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2019-10-22 08:56:52,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:52,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:52,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:52,205 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:52,205 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:56:52,205 INFO L791 eck$LassoCheckResult]: Stem: 1065#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1059#L-1 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.allocOnStack((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.allocOnStack((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; 1060#L16-3 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; 1071#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1072#L16-3 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; 1073#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1083#L16-3 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; 1082#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1081#L16-3 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; 1080#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1079#L16-3 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; 1076#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1075#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1068#L16-4 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); 1061#L24-3 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; 1062#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1063#L24-3 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; 1064#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1086#L24-3 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; 1085#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1084#L24-3 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; 1078#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1077#L24-3 assume !(main_~i~0 >= 0); 1074#L24-4 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; 1066#L30-3 [2019-10-22 08:56:52,205 INFO L793 eck$LassoCheckResult]: Loop: 1066#L30-3 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);__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; 1067#L4 assume !(0 == __VERIFIER_assert_~cond); 1070#L4-2 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; 1069#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 1066#L30-3 [2019-10-22 08:56:52,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:52,205 INFO L82 PathProgramCache]: Analyzing trace with hash -430652763, now seen corresponding path program 4 times [2019-10-22 08:56:52,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:52,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090587820] [2019-10-22 08:56:52,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 08:56:52,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090587820] [2019-10-22 08:56:52,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565967748] [2019-10-22 08:56:52,420 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa6d37e0-9fc9-467b-8362-d617d2a49150/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:52,479 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 08:56:52,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:52,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 08:56:52,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 08:56:52,565 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:52,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-10-22 08:56:52,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182215796] [2019-10-22 08:56:52,566 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:52,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:52,566 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 5 times [2019-10-22 08:56:52,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:52,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805746576] [2019-10-22 08:56:52,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:52,575 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:52,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:52,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 08:56:52,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:56:52,665 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. cyclomatic complexity: 5 Second operand 16 states. [2019-10-22 08:56:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:53,075 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-10-22 08:56:53,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:56:53,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 48 transitions. [2019-10-22 08:56:53,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:53,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 48 transitions. [2019-10-22 08:56:53,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-10-22 08:56:53,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-10-22 08:56:53,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 48 transitions. [2019-10-22 08:56:53,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:53,078 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-10-22 08:56:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 48 transitions. [2019-10-22 08:56:53,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2019-10-22 08:56:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 08:56:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-22 08:56:53,080 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-22 08:56:53,080 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-22 08:56:53,080 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 08:56:53,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2019-10-22 08:56:53,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:56:53,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:53,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:53,081 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:53,081 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:56:53,082 INFO L791 eck$LassoCheckResult]: Stem: 1249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1243#L-1 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.allocOnStack((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.allocOnStack((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; 1244#L16-3 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; 1255#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1256#L16-3 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; 1257#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1258#L16-3 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; 1269#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1267#L16-3 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; 1265#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1264#L16-3 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; 1261#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1260#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1253#L16-4 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); 1245#L24-3 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; 1246#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1247#L24-3 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; 1248#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1272#L24-3 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; 1271#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1270#L24-3 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; 1268#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1266#L24-3 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; 1263#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1262#L24-3 assume !(main_~i~0 >= 0); 1259#L24-4 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; 1250#L30-3 [2019-10-22 08:56:53,082 INFO L793 eck$LassoCheckResult]: Loop: 1250#L30-3 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);__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; 1251#L4 assume !(0 == __VERIFIER_assert_~cond); 1254#L4-2 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; 1252#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 1250#L30-3 [2019-10-22 08:56:53,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:53,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1540388377, now seen corresponding path program 5 times [2019-10-22 08:56:53,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:53,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588366304] [2019-10-22 08:56:53,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,131 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:53,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:53,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 6 times [2019-10-22 08:56:53,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:53,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049696890] [2019-10-22 08:56:53,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,138 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:53,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:53,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1945357456, now seen corresponding path program 1 times [2019-10-22 08:56:53,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:53,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982449501] [2019-10-22 08:56:53,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,192 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:03,748 WARN L191 SmtUtils]: Spent 10.44 s on a formula simplification. DAG size of input: 269 DAG size of output: 208 [2019-10-22 08:57:07,214 WARN L191 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 170 DAG size of output: 125 [2019-10-22 08:57:07,218 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:07,218 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:07,218 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:07,218 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:07,218 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:07,218 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:07,219 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:07,219 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:07,219 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration13_Lasso [2019-10-22 08:57:07,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:07,219 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:07,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,473 FATAL L? ?]: 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.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.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:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) 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) [2019-10-22 08:57:07,476 INFO L168 Benchmark]: Toolchain (without parser) took 25328.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.8 MB). Free memory was 944.5 MB in the beginning and 853.4 MB in the end (delta: 91.1 MB). Peak memory consumption was 378.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:07,476 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:07,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:07,477 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:07,477 INFO L168 Benchmark]: Boogie Preprocessor took 27.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:07,478 INFO L168 Benchmark]: RCFGBuilder took 278.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:07,479 INFO L168 Benchmark]: BuchiAutomizer took 24614.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.1 MB). Free memory was 1.1 GB in the beginning and 853.4 MB in the end (delta: 244.5 MB). Peak memory consumption was 398.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:07,481 INFO L335 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 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 278.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24614.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.1 MB). Free memory was 1.1 GB in the beginning and 853.4 MB in the end (delta: 244.5 MB). Peak memory consumption was 398.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...