./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/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/invert_string-3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/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/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/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-11-15 21:24:00,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:24:00,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:24:00,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:24:00,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:24:00,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:24:00,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:24:00,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:24:00,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:24:00,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:24:00,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:24:00,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:24:00,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:24:00,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:24:00,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:24:00,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:24:00,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:24:00,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:24:00,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:24:00,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:24:00,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:24:00,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:24:00,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:24:00,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:24:00,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:24:00,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:24:00,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:24:00,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:24:00,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:24:00,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:24:00,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:24:00,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:24:00,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:24:00,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:24:00,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:24:00,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:24:00,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:24:00,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:24:00,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:24:00,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:24:00,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:24:00,775 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 21:24:00,796 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:24:00,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:24:00,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:24:00,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:24:00,799 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:24:00,799 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:24:00,799 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:24:00,799 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:24:00,799 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:24:00,800 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:24:00,801 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:24:00,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:24:00,801 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:24:00,801 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:24:00,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:24:00,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:24:00,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:24:00,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:24:00,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:24:00,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:24:00,803 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:24:00,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:24:00,803 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:24:00,803 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:24:00,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:24:00,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:24:00,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:24:00,804 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:24:00,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:24:00,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:24:00,805 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:24:00,808 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:24:00,808 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/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/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-11-15 21:24:00,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:24:00,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:24:00,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:24:00,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:24:00,876 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:24:00,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/bin/uautomizer/../../sv-benchmarks/c/loops/invert_string-3.c [2019-11-15 21:24:00,941 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/bin/uautomizer/data/6e3ade612/ee9f2c17afe948668b0a966e58f87624/FLAGce47230e0 [2019-11-15 21:24:01,290 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:24:01,291 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/sv-benchmarks/c/loops/invert_string-3.c [2019-11-15 21:24:01,296 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/bin/uautomizer/data/6e3ade612/ee9f2c17afe948668b0a966e58f87624/FLAGce47230e0 [2019-11-15 21:24:01,670 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/bin/uautomizer/data/6e3ade612/ee9f2c17afe948668b0a966e58f87624 [2019-11-15 21:24:01,673 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:24:01,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:24:01,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:24:01,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:24:01,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:24:01,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:24:01" (1/1) ... [2019-11-15 21:24:01,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4debb188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:01, skipping insertion in model container [2019-11-15 21:24:01,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:24:01" (1/1) ... [2019-11-15 21:24:01,690 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:24:01,705 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:24:01,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:24:01,899 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:24:02,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:24:02,038 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:24:02,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02 WrapperNode [2019-11-15 21:24:02,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:24:02,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:24:02,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:24:02,040 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:24:02,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:02,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:02,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:24:02,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:24:02,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:24:02,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:24:02,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:02,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:02,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:02,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:02,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:02,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:02,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... [2019-11-15 21:24:02,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:24:02,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:24:02,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:24:02,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:24:02,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/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-11-15 21:24:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:24:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:24:02,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:24:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:24:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:24:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:24:02,402 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:24:02,402 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 21:24:02,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:24:02 BoogieIcfgContainer [2019-11-15 21:24:02,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:24:02,404 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:24:02,404 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:24:02,407 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:24:02,408 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:24:02,408 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:24:01" (1/3) ... [2019-11-15 21:24:02,409 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39a1d363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:24:02, skipping insertion in model container [2019-11-15 21:24:02,409 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:24:02,409 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:24:02" (2/3) ... [2019-11-15 21:24:02,410 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39a1d363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:24:02, skipping insertion in model container [2019-11-15 21:24:02,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:24:02,410 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:24:02" (3/3) ... [2019-11-15 21:24:02,411 INFO L371 chiAutomizerObserver]: Analyzing ICFG invert_string-3.c [2019-11-15 21:24:02,451 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:24:02,452 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:24:02,452 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:24:02,452 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:24:02,452 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:24:02,452 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:24:02,453 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:24:02,453 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:24:02,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 21:24:02,484 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 21:24:02,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:24:02,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:24:02,491 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:24:02,491 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:24:02,491 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:24:02,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 21:24:02,493 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 21:24:02,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:24:02,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:24:02,494 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:24:02,494 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:24:02,501 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-11-15 21:24:02,502 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-11-15 21:24:02,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:02,509 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 21:24:02,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:02,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139711620] [2019-11-15 21:24:02,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:02,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:02,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:02,637 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:02,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-15 21:24:02,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:02,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237054732] [2019-11-15 21:24:02,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:02,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:02,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:02,665 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:02,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:02,667 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-15 21:24:02,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:02,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729709238] [2019-11-15 21:24:02,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:02,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:02,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:02,719 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:03,072 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-11-15 21:24:03,086 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:24:03,087 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:24:03,088 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:24:03,088 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:24:03,088 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:24:03,088 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:24:03,088 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:24:03,089 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:24:03,089 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration1_Lasso [2019-11-15 21:24:03,089 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:24:03,089 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:24:03,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:03,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:03,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:03,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:03,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:03,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:03,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:03,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:03,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:03,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:03,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:03,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:03,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:03,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:03,683 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:24:03,688 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:24:03,690 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-11-15 21:24:03,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:03,692 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:24:03,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:03,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:03,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:03,696 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:24:03,697 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:24:03,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:03,700 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-11-15 21:24:03,700 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:03,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:03,702 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:03,702 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:03,705 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:24:03,705 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:24:03,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:03,727 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-11-15 21:24:03,730 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:03,731 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:24:03,732 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:03,732 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:03,732 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:03,733 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:24:03,733 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:24:03,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:03,736 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-11-15 21:24:03,737 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:03,737 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:24:03,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:03,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:03,740 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:03,740 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:24:03,740 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:24:03,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:03,743 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-11-15 21:24:03,744 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:03,745 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:24:03,745 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:03,746 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:03,746 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:03,746 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:24:03,746 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:24:03,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:03,748 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-11-15 21:24:03,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:03,750 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:24:03,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:03,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:03,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:03,751 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:24:03,751 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:24:03,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:03,752 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-11-15 21:24:03,753 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:03,753 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:03,754 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:03,754 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:03,759 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:24:03,760 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:24:03,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:03,777 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-11-15 21:24:03,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:03,778 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:24:03,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:03,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:03,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:03,779 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:24:03,779 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:24:03,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:03,781 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-11-15 21:24:03,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:03,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:03,782 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:03,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:03,784 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:24:03,790 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:24:03,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:03,807 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-11-15 21:24:03,808 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:03,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:03,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:03,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:03,810 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:24:03,814 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:24:03,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:03,819 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-11-15 21:24:03,820 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:03,820 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:24:03,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:03,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:03,821 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:03,821 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:24:03,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:24:03,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:03,823 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-11-15 21:24:03,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:03,823 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 21:24:03,824 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:03,824 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:03,827 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:24:03,827 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:24:03,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:03,846 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-11-15 21:24:03,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:03,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:03,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:03,849 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:03,855 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:24:03,856 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:24:03,943 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:24:03,964 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:24:03,965 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:24:03,967 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:24:03,968 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:24:03,968 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:24:03,969 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-11-15 21:24:03,978 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 21:24:03,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:24:04,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:04,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:24:04,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:04,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:24:04,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:24:04,083 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-11-15 21:24:04,085 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-11-15 21:24:04,132 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-11-15 21:24:04,133 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-11-15 21:24:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:24:04,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-15 21:24:04,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-15 21:24:04,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:24:04,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 21:24:04,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:24:04,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 21:24:04,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:24:04,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2019-11-15 21:24:04,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:24:04,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2019-11-15 21:24:04,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:24:04,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 21:24:04,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-15 21:24:04,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:24:04,149 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 21:24:04,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-15 21:24:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 21:24:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 21:24:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-15 21:24:04,175 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 21:24:04,175 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 21:24:04,175 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:24:04,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-15 21:24:04,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:24:04,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:24:04,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:24:04,177 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:24:04,189 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:24:04,189 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-11-15 21:24:04,189 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-11-15 21:24:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:04,190 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-15 21:24:04,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:04,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658430004] [2019-11-15 21:24:04,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:04,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:04,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:24:04,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658430004] [2019-11-15 21:24:04,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:24:04,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:24:04,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211880317] [2019-11-15 21:24:04,375 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:24:04,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2019-11-15 21:24:04,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:04,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010098523] [2019-11-15 21:24:04,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:04,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:04,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:04,400 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:04,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:04,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:24:04,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:24:04,476 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 21:24:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:04,518 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-15 21:24:04,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:24:04,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-11-15 21:24:04,520 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:24:04,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2019-11-15 21:24:04,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:24:04,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:24:04,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-11-15 21:24:04,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:24:04,522 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 21:24:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-11-15 21:24:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-11-15 21:24:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 21:24:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-11-15 21:24:04,524 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-15 21:24:04,524 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-15 21:24:04,524 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:24:04,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2019-11-15 21:24:04,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:24:04,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:24:04,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:24:04,525 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:24:04,525 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:24:04,525 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-11-15 21:24:04,526 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-11-15 21:24:04,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:04,526 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-15 21:24:04,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:04,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937271622] [2019-11-15 21:24:04,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:04,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:04,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:24:04,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937271622] [2019-11-15 21:24:04,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741907542] [2019-11-15 21:24:04,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/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-11-15 21:24:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:04,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 21:24:04,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:04,764 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_1, |v_#length_28|], 1=[|v_#valid_41|]} [2019-11-15 21:24:04,776 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 21:24:04,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:04,806 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-11-15 21:24:04,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:24:04,830 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-11-15 21:24:04,831 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:04,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:04,859 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-11-15 21:24:04,859 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:04,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:04,874 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-11-15 21:24:04,875 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2019-11-15 21:24:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:24:04,939 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:24:04,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-15 21:24:04,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878439490] [2019-11-15 21:24:04,940 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:24:04,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:04,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2019-11-15 21:24:04,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:04,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108939835] [2019-11-15 21:24:04,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:04,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:04,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:04,950 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:05,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:05,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:24:05,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:24:05,022 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-15 21:24:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:05,138 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-11-15 21:24:05,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:24:05,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2019-11-15 21:24:05,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:24:05,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2019-11-15 21:24:05,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:24:05,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:24:05,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2019-11-15 21:24:05,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:24:05,143 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-15 21:24:05,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2019-11-15 21:24:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-15 21:24:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 21:24:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-15 21:24:05,145 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 21:24:05,145 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 21:24:05,145 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:24:05,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-11-15 21:24:05,146 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:24:05,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:24:05,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:24:05,147 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-15 21:24:05,147 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:24:05,147 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-11-15 21:24:05,148 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-11-15 21:24:05,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:05,152 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-11-15 21:24:05,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:05,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86115955] [2019-11-15 21:24:05,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:05,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:05,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:24:05,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86115955] [2019-11-15 21:24:05,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062294502] [2019-11-15 21:24:05,285 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/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-11-15 21:24:05,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:24:05,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:24:05,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:24:05,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:24:05,389 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:24:05,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-11-15 21:24:05,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299402108] [2019-11-15 21:24:05,390 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:24:05,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:05,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2019-11-15 21:24:05,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:05,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594559139] [2019-11-15 21:24:05,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:05,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:05,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:05,397 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:05,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:05,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:24:05,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:24:05,457 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-11-15 21:24:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:05,542 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-11-15 21:24:05,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:24:05,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-11-15 21:24:05,544 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:24:05,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2019-11-15 21:24:05,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:24:05,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:24:05,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2019-11-15 21:24:05,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:24:05,545 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 21:24:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2019-11-15 21:24:05,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-15 21:24:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 21:24:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-15 21:24:05,547 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 21:24:05,547 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 21:24:05,547 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:24:05,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-11-15 21:24:05,548 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:24:05,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:24:05,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:24:05,548 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-15 21:24:05,548 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:24:05,548 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-11-15 21:24:05,549 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-11-15 21:24:05,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:05,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-11-15 21:24:05,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:05,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190841948] [2019-11-15 21:24:05,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:05,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:05,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:24:06,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190841948] [2019-11-15 21:24:06,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196460322] [2019-11-15 21:24:06,135 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/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-11-15 21:24:06,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 21:24:06,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:24:06,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 21:24:06,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:06,193 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|, v_prenex_2], 1=[|v_#valid_44|]} [2019-11-15 21:24:06,200 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 21:24:06,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:06,229 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-11-15 21:24:06,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:24:06,235 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-11-15 21:24:06,236 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:06,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:06,253 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-11-15 21:24:06,253 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:24:06,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:24:06,266 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-11-15 21:24:06,266 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2019-11-15 21:24:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:24:06,446 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:24:06,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-11-15 21:24:06,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801244597] [2019-11-15 21:24:06,447 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:24:06,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2019-11-15 21:24:06,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:06,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566002938] [2019-11-15 21:24:06,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:06,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:06,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:06,461 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:06,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:06,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:24:06,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:24:06,520 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand 12 states. [2019-11-15 21:24:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:06,668 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-15 21:24:06,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:24:06,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-15 21:24:06,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:24:06,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-11-15 21:24:06,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:24:06,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:24:06,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-11-15 21:24:06,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:24:06,671 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-15 21:24:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-11-15 21:24:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-15 21:24:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 21:24:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-11-15 21:24:06,673 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-15 21:24:06,673 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-15 21:24:06,673 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:24:06,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2019-11-15 21:24:06,674 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:24:06,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:24:06,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:24:06,674 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-15 21:24:06,674 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:24:06,674 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-11-15 21:24:06,675 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-11-15 21:24:06,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:06,675 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-11-15 21:24:06,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:06,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87570569] [2019-11-15 21:24:06,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:06,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:06,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:24:07,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87570569] [2019-11-15 21:24:07,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184951706] [2019-11-15 21:24:07,162 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/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-11-15 21:24:07,208 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:24:07,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:24:07,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 21:24:07,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:24:07,322 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:24:07,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-11-15 21:24:07,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610802972] [2019-11-15 21:24:07,323 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:24:07,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:07,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2019-11-15 21:24:07,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:07,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404588938] [2019-11-15 21:24:07,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:07,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:07,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:07,329 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:07,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:07,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 21:24:07,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:24:07,383 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand 14 states. [2019-11-15 21:24:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:07,845 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-11-15 21:24:07,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:24:07,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2019-11-15 21:24:07,846 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:24:07,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2019-11-15 21:24:07,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:24:07,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:24:07,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2019-11-15 21:24:07,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:24:07,847 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-15 21:24:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2019-11-15 21:24:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-15 21:24:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 21:24:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-11-15 21:24:07,849 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-15 21:24:07,849 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-15 21:24:07,849 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:24:07,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2019-11-15 21:24:07,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:24:07,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:24:07,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:24:07,850 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-11-15 21:24:07,850 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:24:07,850 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-11-15 21:24:07,850 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-11-15 21:24:07,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-11-15 21:24:07,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:07,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837698891] [2019-11-15 21:24:07,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:07,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:07,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:07,889 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:07,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:07,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2019-11-15 21:24:07,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:07,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794282128] [2019-11-15 21:24:07,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:07,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:07,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:07,896 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:07,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:07,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2019-11-15 21:24:07,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:07,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933370204] [2019-11-15 21:24:07,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:07,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:07,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:07,941 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:09,170 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 150 DAG size of output: 121 [2019-11-15 21:24:09,792 WARN L191 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-11-15 21:24:09,794 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:24:09,794 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:24:09,794 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:24:09,794 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:24:09,794 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:24:09,794 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:24:09,794 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:24:09,794 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:24:09,794 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration7_Lasso [2019-11-15 21:24:09,794 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:24:09,794 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:24:09,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:09,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:09,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:09,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:09,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:09,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:09,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:09,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:09,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:09,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:09,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:09,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:09,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:10,086 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-15 21:24:10,291 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:24:10,292 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:24:10,292 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-11-15 21:24:10,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:10,293 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:24:10,293 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:10,293 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:10,293 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:10,294 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:24:10,294 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:24:10,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:10,295 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-11-15 21:24:10,295 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:10,295 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:24:10,295 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:10,295 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:10,296 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:10,296 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:24:10,296 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:24:10,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:10,297 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-11-15 21:24:10,297 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:10,297 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:24:10,297 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:10,298 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:10,298 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:10,298 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:24:10,298 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:24:10,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:10,299 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-11-15 21:24:10,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:10,299 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:24:10,300 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:10,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:10,300 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:10,300 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:24:10,300 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:24:10,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:10,301 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-11-15 21:24:10,301 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:10,302 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:10,302 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:10,302 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:10,303 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:24:10,303 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:24:10,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:10,304 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-11-15 21:24:10,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:10,305 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:10,305 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:10,305 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:10,306 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:24:10,306 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:24:10,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:24:10,309 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-11-15 21:24:10,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:24:10,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:24:10,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:24:10,310 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:24:10,313 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:24:10,314 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:24:10,358 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:24:10,384 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 21:24:10,384 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 21:24:10,385 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:24:10,386 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:24:10,386 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:24:10,386 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-11-15 21:24:10,400 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 21:24:10,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:10,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:24:10,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:10,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:24:10,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:24:10,451 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-11-15 21:24:10,451 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 21:24:10,466 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-11-15 21:24:10,467 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-11-15 21:24:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:24:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-11-15 21:24:10,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-15 21:24:10,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:24:10,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-15 21:24:10,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:24:10,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-15 21:24:10,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:24:10,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-15 21:24:10,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:24:10,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 25 transitions. [2019-11-15 21:24:10,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 21:24:10,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 21:24:10,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-11-15 21:24:10,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:24:10,472 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-15 21:24:10,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-11-15 21:24:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-15 21:24:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 21:24:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-15 21:24:10,474 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-15 21:24:10,474 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-15 21:24:10,474 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:24:10,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2019-11-15 21:24:10,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:24:10,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:24:10,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:24:10,475 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2019-11-15 21:24:10,475 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:24:10,476 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-11-15 21:24:10,476 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~mem6;havoc main_#t~mem7;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-11-15 21:24:10,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:10,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425437, now seen corresponding path program 1 times [2019-11-15 21:24:10,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:10,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761731036] [2019-11-15 21:24:10,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:10,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:10,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:24:11,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761731036] [2019-11-15 21:24:11,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659174635] [2019-11-15 21:24:11,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/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-11-15 21:24:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:11,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:24:11,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:11,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:11,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:11,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:11,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:11,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:24:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 21:24:11,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:24:11,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-11-15 21:24:11,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009635616] [2019-11-15 21:24:11,134 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:24:11,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:11,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 1 times [2019-11-15 21:24:11,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:11,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491056118] [2019-11-15 21:24:11,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:11,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:11,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:11,144 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:11,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:11,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:24:11,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:24:11,279 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-15 21:24:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:23,342 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-11-15 21:24:23,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:24:23,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2019-11-15 21:24:23,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:24:23,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2019-11-15 21:24:23,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:24:23,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:24:23,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-11-15 21:24:23,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:24:23,343 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-15 21:24:23,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-11-15 21:24:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-15 21:24:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 21:24:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-15 21:24:23,345 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-15 21:24:23,345 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-15 21:24:23,345 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 21:24:23,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-11-15 21:24:23,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:24:23,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:24:23,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:24:23,346 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:24:23,346 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:24:23,346 INFO L791 eck$LassoCheckResult]: Stem: 676#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 670#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; 671#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; 682#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 683#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; 684#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 691#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); 679#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); 672#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; 673#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 674#L24-3 assume !(main_~i~0 >= 0); 675#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; 677#L30-3 [2019-11-15 21:24:23,346 INFO L793 eck$LassoCheckResult]: Loop: 677#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; 678#L4 assume !(0 == __VERIFIER_assert_~cond); 681#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 680#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 677#L30-3 [2019-11-15 21:24:23,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:23,346 INFO L82 PathProgramCache]: Analyzing trace with hash -743540257, now seen corresponding path program 1 times [2019-11-15 21:24:23,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:23,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957894906] [2019-11-15 21:24:23,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:23,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:23,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 21:24:23,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957894906] [2019-11-15 21:24:23,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019314358] [2019-11-15 21:24:23,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/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-11-15 21:24:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:23,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:24:23,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 21:24:23,597 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:24:23,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-11-15 21:24:23,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67084436] [2019-11-15 21:24:23,597 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:24:23,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:23,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 2 times [2019-11-15 21:24:23,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:23,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544030963] [2019-11-15 21:24:23,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:23,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:23,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:23,606 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:23,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:23,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:24:23,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:24:23,703 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 5 Second operand 9 states. [2019-11-15 21:24:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:23,784 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-11-15 21:24:23,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:24:23,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2019-11-15 21:24:23,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:24:23,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2019-11-15 21:24:23,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 21:24:23,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 21:24:23,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2019-11-15 21:24:23,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:24:23,786 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-11-15 21:24:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2019-11-15 21:24:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-15 21:24:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 21:24:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-15 21:24:23,788 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-15 21:24:23,788 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-15 21:24:23,788 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 21:24:23,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2019-11-15 21:24:23,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:24:23,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:24:23,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:24:23,789 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 21:24:23,789 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:24:23,789 INFO L791 eck$LassoCheckResult]: Stem: 792#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 786#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; 787#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; 799#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 800#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; 801#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 809#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; 808#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 807#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; 806#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 805#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; 804#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 803#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 796#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); 788#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; 789#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 790#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; 791#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 795#L24-3 assume !(main_~i~0 >= 0); 802#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; 793#L30-3 [2019-11-15 21:24:23,789 INFO L793 eck$LassoCheckResult]: Loop: 793#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; 794#L4 assume !(0 == __VERIFIER_assert_~cond); 798#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 797#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 793#L30-3 [2019-11-15 21:24:23,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:23,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1577559391, now seen corresponding path program 2 times [2019-11-15 21:24:23,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:23,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241386790] [2019-11-15 21:24:23,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:23,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:23,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 21:24:23,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241386790] [2019-11-15 21:24:23,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091768745] [2019-11-15 21:24:23,975 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/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-11-15 21:24:24,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:24:24,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:24:24,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 21:24:24,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 21:24:24,091 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:24:24,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-11-15 21:24:24,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674589283] [2019-11-15 21:24:24,092 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:24:24,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:24,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 3 times [2019-11-15 21:24:24,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:24,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293656410] [2019-11-15 21:24:24,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:24,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:24,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:24,100 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:24,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:24,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:24:24,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:24:24,212 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 5 Second operand 11 states. [2019-11-15 21:24:24,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:24,378 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-11-15 21:24:24,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:24:24,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2019-11-15 21:24:24,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:24:24,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 29 transitions. [2019-11-15 21:24:24,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 21:24:24,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 21:24:24,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2019-11-15 21:24:24,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:24:24,380 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-15 21:24:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2019-11-15 21:24:24,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-11-15 21:24:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 21:24:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-15 21:24:24,382 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-15 21:24:24,382 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-15 21:24:24,382 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 21:24:24,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2019-11-15 21:24:24,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:24:24,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:24:24,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:24:24,383 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-15 21:24:24,384 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:24:24,384 INFO L791 eck$LassoCheckResult]: Stem: 922#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 916#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; 917#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; 940#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; 939#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 938#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; 937#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; 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); 925#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); 918#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; 919#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 920#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; 921#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 941#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; 935#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 934#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; 923#L30-3 [2019-11-15 21:24:24,384 INFO L793 eck$LassoCheckResult]: Loop: 923#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; 924#L4 assume !(0 == __VERIFIER_assert_~cond); 927#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 926#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 923#L30-3 [2019-11-15 21:24:24,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:24,384 INFO L82 PathProgramCache]: Analyzing trace with hash 88937187, now seen corresponding path program 3 times [2019-11-15 21:24:24,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:24,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240199385] [2019-11-15 21:24:24,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:24,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:24,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 21:24:24,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240199385] [2019-11-15 21:24:24,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152941176] [2019-11-15 21:24:24,577 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/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-11-15 21:24:24,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 21:24:24,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:24:24,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:24:24,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 21:24:24,733 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:24:24,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-15 21:24:24,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958827435] [2019-11-15 21:24:24,734 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:24:24,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:24,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 4 times [2019-11-15 21:24:24,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:24,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423371355] [2019-11-15 21:24:24,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:24,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:24,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:24,741 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:24,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:24,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 21:24:24,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:24:24,851 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 5 Second operand 13 states. [2019-11-15 21:24:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:25,058 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-11-15 21:24:25,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:24:25,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2019-11-15 21:24:25,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:24:25,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 31 transitions. [2019-11-15 21:24:25,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 21:24:25,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 21:24:25,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 31 transitions. [2019-11-15 21:24:25,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:24:25,061 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-11-15 21:24:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 31 transitions. [2019-11-15 21:24:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-15 21:24:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 21:24:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-15 21:24:25,063 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-15 21:24:25,063 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-15 21:24:25,063 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 21:24:25,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2019-11-15 21:24:25,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:24:25,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:24:25,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:24:25,064 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2019-11-15 21:24:25,064 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:24:25,065 INFO L791 eck$LassoCheckResult]: Stem: 1066#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1060#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; 1061#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; 1072#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1073#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; 1074#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1084#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; 1083#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1082#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; 1081#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1080#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; 1077#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1076#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1069#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); 1062#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; 1063#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1064#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; 1065#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1087#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; 1086#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1085#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; 1079#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1078#L24-3 assume !(main_~i~0 >= 0); 1075#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; 1067#L30-3 [2019-11-15 21:24:25,065 INFO L793 eck$LassoCheckResult]: Loop: 1067#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; 1068#L4 assume !(0 == __VERIFIER_assert_~cond); 1071#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 1070#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 1067#L30-3 [2019-11-15 21:24:25,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:25,065 INFO L82 PathProgramCache]: Analyzing trace with hash -430652763, now seen corresponding path program 4 times [2019-11-15 21:24:25,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:25,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074703205] [2019-11-15 21:24:25,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:25,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:25,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:24:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 21:24:25,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074703205] [2019-11-15 21:24:25,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557948556] [2019-11-15 21:24:25,318 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cad734e4-9022-4195-8417-75b40aca44d7/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-11-15 21:24:25,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:24:25,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:24:25,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 21:24:25,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:24:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-15 21:24:25,501 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:24:25,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-15 21:24:25,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100515998] [2019-11-15 21:24:25,501 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:24:25,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:25,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 5 times [2019-11-15 21:24:25,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:25,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76491158] [2019-11-15 21:24:25,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:25,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:25,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:25,512 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:25,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:24:25,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 21:24:25,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:24:25,612 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. cyclomatic complexity: 5 Second operand 16 states. [2019-11-15 21:24:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:24:26,083 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-11-15 21:24:26,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:24:26,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 48 transitions. [2019-11-15 21:24:26,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:24:26,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 48 transitions. [2019-11-15 21:24:26,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-15 21:24:26,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-15 21:24:26,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 48 transitions. [2019-11-15 21:24:26,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:24:26,086 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-11-15 21:24:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 48 transitions. [2019-11-15 21:24:26,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2019-11-15 21:24:26,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 21:24:26,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-15 21:24:26,088 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-15 21:24:26,088 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-15 21:24:26,088 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 21:24:26,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2019-11-15 21:24:26,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:24:26,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:24:26,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:24:26,090 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2019-11-15 21:24:26,090 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:24:26,090 INFO L791 eck$LassoCheckResult]: Stem: 1250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1244#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; 1245#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; 1256#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1257#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; 1258#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1259#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; 1270#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1268#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; 1266#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1265#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; 1262#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1261#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1254#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); 1246#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; 1247#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1248#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; 1249#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1273#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; 1272#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1271#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; 1269#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1267#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; 1264#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1263#L24-3 assume !(main_~i~0 >= 0); 1260#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; 1251#L30-3 [2019-11-15 21:24:26,090 INFO L793 eck$LassoCheckResult]: Loop: 1251#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; 1252#L4 assume !(0 == __VERIFIER_assert_~cond); 1255#L4-2 havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 1253#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 1251#L30-3 [2019-11-15 21:24:26,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:26,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1540388377, now seen corresponding path program 5 times [2019-11-15 21:24:26,090 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:26,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225988976] [2019-11-15 21:24:26,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:26,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:26,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:26,143 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:26,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:26,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 6 times [2019-11-15 21:24:26,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:26,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248573136] [2019-11-15 21:24:26,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:26,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:26,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:26,151 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:26,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:24:26,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1945357456, now seen corresponding path program 1 times [2019-11-15 21:24:26,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:24:26,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180382956] [2019-11-15 21:24:26,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:26,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:24:26,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:24:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:24:26,205 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:24:26,344 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-15 21:24:38,109 WARN L191 SmtUtils]: Spent 11.76 s on a formula simplification. DAG size of input: 269 DAG size of output: 208 [2019-11-15 21:24:41,834 WARN L191 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 170 DAG size of output: 125 [2019-11-15 21:24:41,836 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:24:41,837 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:24:41,837 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:24:41,837 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:24:41,837 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:24:41,837 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:24:41,837 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:24:41,837 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:24:41,837 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration13_Lasso [2019-11-15 21:24:41,837 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:24:41,837 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:24:41,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:41,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:41,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:41,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:41,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:41,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:24:42,145 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-11-15 21:24:42,148 INFO L168 Benchmark]: Toolchain (without parser) took 40473.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 944.7 MB in the beginning and 968.1 MB in the end (delta: -23.4 MB). Peak memory consumption was 286.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:24:42,148 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:24:42,149 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -201.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:24:42,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.81 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:24:42,150 INFO L168 Benchmark]: Boogie Preprocessor took 33.98 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-11-15 21:24:42,150 INFO L168 Benchmark]: RCFGBuilder took 287.54 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:24:42,150 INFO L168 Benchmark]: BuchiAutomizer took 39743.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 968.1 MB in the end (delta: 151.2 MB). Peak memory consumption was 312.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:24:42,152 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -201.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.81 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.98 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 287.54 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 39743.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 968.1 MB in the end (delta: 151.2 MB). Peak memory consumption was 312.8 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...