./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/invert_string-3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/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_d586565d-de10-46da-a1a7-21949ef13d5b/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-678e011 [2019-11-20 10:16:42,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:16:42,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:16:42,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:16:42,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:16:42,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:16:42,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:16:42,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:16:42,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:16:42,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:16:42,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:16:42,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:16:42,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:16:42,685 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:16:42,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:16:42,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:16:42,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:16:42,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:16:42,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:16:42,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:16:42,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:16:42,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:16:42,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:16:42,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:16:42,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:16:42,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:16:42,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:16:42,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:16:42,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:16:42,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:16:42,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:16:42,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:16:42,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:16:42,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:16:42,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:16:42,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:16:42,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:16:42,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:16:42,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:16:42,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:16:42,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:16:42,723 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 10:16:42,743 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:16:42,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:16:42,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:16:42,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:16:42,746 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:16:42,746 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 10:16:42,746 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 10:16:42,746 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 10:16:42,747 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 10:16:42,747 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 10:16:42,748 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 10:16:42,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:16:42,748 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:16:42,748 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 10:16:42,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:16:42,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:16:42,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:16:42,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 10:16:42,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 10:16:42,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 10:16:42,749 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:16:42,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:16:42,750 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 10:16:42,750 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:16:42,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 10:16:42,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:16:42,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:16:42,751 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 10:16:42,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:16:42,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:16:42,751 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 10:16:42,752 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 10:16:42,753 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_d586565d-de10-46da-a1a7-21949ef13d5b/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-20 10:16:42,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:16:42,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:16:42,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:16:42,907 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:16:42,908 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:16:42,908 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/../../sv-benchmarks/c/loops/invert_string-3.c [2019-11-20 10:16:42,965 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/data/d1322db23/9cd0ae3216fd45b6a57b98c955ffce04/FLAG2fa474027 [2019-11-20 10:16:43,376 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:16:43,376 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/sv-benchmarks/c/loops/invert_string-3.c [2019-11-20 10:16:43,382 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/data/d1322db23/9cd0ae3216fd45b6a57b98c955ffce04/FLAG2fa474027 [2019-11-20 10:16:43,394 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/data/d1322db23/9cd0ae3216fd45b6a57b98c955ffce04 [2019-11-20 10:16:43,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:16:43,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:16:43,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:16:43,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:16:43,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:16:43,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:16:43" (1/1) ... [2019-11-20 10:16:43,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28e04513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:43, skipping insertion in model container [2019-11-20 10:16:43,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:16:43" (1/1) ... [2019-11-20 10:16:43,420 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:16:43,439 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:16:43,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:16:43,719 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:16:43,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:16:43,769 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:16:43,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:43 WrapperNode [2019-11-20 10:16:43,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:16:43,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:16:43,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:16:43,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:16:43,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:43" (1/1) ... [2019-11-20 10:16:43,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:43" (1/1) ... [2019-11-20 10:16:43,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:16:43,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:16:43,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:16:43,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:16:43,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:43" (1/1) ... [2019-11-20 10:16:43,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:43" (1/1) ... [2019-11-20 10:16:43,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:43" (1/1) ... [2019-11-20 10:16:43,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:43" (1/1) ... [2019-11-20 10:16:43,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:43" (1/1) ... [2019-11-20 10:16:43,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:43" (1/1) ... [2019-11-20 10:16:43,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:43" (1/1) ... [2019-11-20 10:16:43,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:16:43,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:16:43,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:16:43,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:16:43,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/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-20 10:16:43,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 10:16:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:16:43,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:16:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 10:16:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:16:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 10:16:44,143 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:16:44,144 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-20 10:16:44,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:16:44 BoogieIcfgContainer [2019-11-20 10:16:44,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:16:44,145 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 10:16:44,145 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 10:16:44,149 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 10:16:44,157 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 10:16:44,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:16:43" (1/3) ... [2019-11-20 10:16:44,158 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c53d197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:16:44, skipping insertion in model container [2019-11-20 10:16:44,158 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 10:16:44,158 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:43" (2/3) ... [2019-11-20 10:16:44,166 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c53d197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:16:44, skipping insertion in model container [2019-11-20 10:16:44,166 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 10:16:44,166 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:16:44" (3/3) ... [2019-11-20 10:16:44,168 INFO L371 chiAutomizerObserver]: Analyzing ICFG invert_string-3.c [2019-11-20 10:16:44,208 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 10:16:44,208 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 10:16:44,208 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 10:16:44,209 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:16:44,209 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:16:44,209 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 10:16:44,209 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:16:44,209 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 10:16:44,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-20 10:16:44,241 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 10:16:44,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:16:44,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:16:44,246 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 10:16:44,246 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 10:16:44,246 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 10:16:44,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-20 10:16:44,247 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-20 10:16:44,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:16:44,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:16:44,248 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 10:16:44,248 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 10:16:44,255 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-20 10:16:44,255 INFO L796 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-20 10:16:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-20 10:16:44,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:44,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165939994] [2019-11-20 10:16:44,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:44,402 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:44,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:44,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-20 10:16:44,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:44,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147554468] [2019-11-20 10:16:44,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:44,429 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:44,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-20 10:16:44,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:44,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396225205] [2019-11-20 10:16:44,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:44,478 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:44,692 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-20 10:16:44,859 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-11-20 10:16:44,869 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 10:16:44,869 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 10:16:44,870 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 10:16:44,870 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 10:16:44,870 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 10:16:44,870 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:44,870 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 10:16:44,870 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 10:16:44,870 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration1_Lasso [2019-11-20 10:16:44,870 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 10:16:44,871 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 10:16:44,892 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-20 10:16:44,901 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-20 10:16:44,906 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-20 10:16:44,908 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-20 10:16:44,910 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-20 10:16:44,914 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-20 10:16:44,916 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-20 10:16:44,920 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-20 10:16:45,011 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-20 10:16:45,015 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-20 10:16:45,018 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-20 10:16:45,021 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-20 10:16:45,024 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-20 10:16:45,027 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-20 10:16:45,361 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 10:16:45,365 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:16:45,375 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-20 10:16:45,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:45,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:16:45,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:45,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:45,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:45,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:16:45,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:45,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:45,404 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-20 10:16:45,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:45,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:45,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:45,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:45,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:16:45,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 10:16:45,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:16:45,442 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-20 10:16:45,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:45,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:16:45,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:45,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:45,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:45,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:16:45,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:45,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:16:45,466 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-20 10:16:45,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:45,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:16:45,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:45,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:45,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:45,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:16:45,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:45,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:16:45,490 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-20 10:16:45,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:45,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:16:45,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:45,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:45,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:45,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:16:45,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:45,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:16:45,514 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-20 10:16:45,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:45,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:16:45,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:45,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:45,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:45,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:16:45,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:45,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:16:45,535 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-20 10:16:45,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:45,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:45,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:45,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:45,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:16:45,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:45,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:16:45,566 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-20 10:16:45,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:45,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:16:45,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:45,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:45,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:45,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:16:45,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:45,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:16:45,590 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-20 10:16:45,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:45,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:45,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:45,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:45,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:16:45,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:45,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:16:45,623 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-20 10:16:45,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:45,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:45,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:45,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:45,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:16:45,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:45,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:16:45,653 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-20 10:16:45,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:45,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:16:45,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:45,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:45,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:45,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:16:45,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:45,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:16:45,675 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-20 10:16:45,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:45,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:45,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:45,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:45,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:16:45,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:45,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 10:16:45,813 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-20 10:16:45,813 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:45,866 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 10:16:45,869 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 10:16:45,869 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 10:16:45,870 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-20 10:16:45,880 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-20 10:16:45,886 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 10:16:45,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:45,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:16:45,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:45,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 10:16:45,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:45,950 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-20 10:16:45,965 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-20 10:16:45,967 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-11-20 10:16:46,041 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-20 10:16:46,042 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-20 10:16:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 10:16:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-20 10:16:46,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-20 10:16:46,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:16:46,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-20 10:16:46,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:16:46,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-20 10:16:46,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:16:46,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2019-11-20 10:16:46,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-20 10:16:46,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2019-11-20 10:16:46,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 10:16:46,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-20 10:16:46,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-20 10:16:46,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:16:46,057 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-20 10:16:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-20 10:16:46,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-20 10:16:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 10:16:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-20 10:16:46,091 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-20 10:16:46,092 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-20 10:16:46,092 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 10:16:46,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-20 10:16:46,095 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-20 10:16:46,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:16:46,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:16:46,096 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 10:16:46,096 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 10:16:46,097 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-20 10:16:46,097 INFO L796 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-20 10:16:46,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:46,098 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-20 10:16:46,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:46,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043255266] [2019-11-20 10:16:46,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:46,301 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-20 10:16:46,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043255266] [2019-11-20 10:16:46,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:46,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:16:46,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303559265] [2019-11-20 10:16:46,306 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:16:46,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2019-11-20 10:16:46,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:46,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130824262] [2019-11-20 10:16:46,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:46,326 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:46,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:46,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:46,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:46,406 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-20 10:16:46,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:46,444 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-20 10:16:46,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:46,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-11-20 10:16:46,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 10:16:46,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2019-11-20 10:16:46,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 10:16:46,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 10:16:46,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-11-20 10:16:46,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:16:46,447 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-20 10:16:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-11-20 10:16:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-11-20 10:16:46,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 10:16:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-11-20 10:16:46,449 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-20 10:16:46,449 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-20 10:16:46,449 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 10:16:46,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2019-11-20 10:16:46,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 10:16:46,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:16:46,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:16:46,451 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-20 10:16:46,451 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 10:16:46,451 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-20 10:16:46,451 INFO L796 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-20 10:16:46,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:46,451 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-20 10:16:46,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:46,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145111552] [2019-11-20 10:16:46,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:46,581 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-20 10:16:46,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145111552] [2019-11-20 10:16:46,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931304374] [2019-11-20 10:16:46,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:46,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 10:16:46,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:46,657 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_1, |v_#length_28|], 1=[|v_#valid_41|]} [2019-11-20 10:16:46,666 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 10:16:46,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:16:46,690 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-11-20 10:16:46,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:16:46,703 INFO L377 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-20 10:16:46,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:16:46,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:16:46,728 INFO L377 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-20 10:16:46,728 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:16:46,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:16:46,751 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-20 10:16:46,751 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2019-11-20 10:16:46,809 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-20 10:16:46,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:16:46,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-20 10:16:46,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563648799] [2019-11-20 10:16:46,810 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:16:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2019-11-20 10:16:46,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:46,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333067079] [2019-11-20 10:16:46,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:46,820 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:46,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:46,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:16:46,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:16:46,893 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-20 10:16:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:46,996 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-11-20 10:16:46,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:16:46,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2019-11-20 10:16:46,997 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 10:16:46,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2019-11-20 10:16:46,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 10:16:46,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 10:16:46,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2019-11-20 10:16:46,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:16:46,999 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-20 10:16:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2019-11-20 10:16:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-20 10:16:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 10:16:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-20 10:16:47,001 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-20 10:16:47,001 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-20 10:16:47,001 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 10:16:47,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-11-20 10:16:47,002 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 10:16:47,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:16:47,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:16:47,002 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-20 10:16:47,002 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 10:16:47,003 INFO L794 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-20 10:16:47,003 INFO L796 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-20 10:16:47,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:47,003 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-11-20 10:16:47,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:47,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446360479] [2019-11-20 10:16:47,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:47,123 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-20 10:16:47,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446360479] [2019-11-20 10:16:47,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635966512] [2019-11-20 10:16:47,124 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:47,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 10:16:47,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:16:47,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 10:16:47,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:47,197 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-20 10:16:47,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:16:47,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-11-20 10:16:47,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443920243] [2019-11-20 10:16:47,198 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:16:47,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:47,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2019-11-20 10:16:47,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:47,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073090737] [2019-11-20 10:16:47,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:47,207 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:47,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:47,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:16:47,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:16:47,256 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-11-20 10:16:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:47,343 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-11-20 10:16:47,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:16:47,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-11-20 10:16:47,344 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 10:16:47,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2019-11-20 10:16:47,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 10:16:47,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 10:16:47,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2019-11-20 10:16:47,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:16:47,345 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-20 10:16:47,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2019-11-20 10:16:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-20 10:16:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 10:16:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-20 10:16:47,347 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-20 10:16:47,347 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-20 10:16:47,347 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 10:16:47,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-11-20 10:16:47,348 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 10:16:47,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:16:47,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:16:47,348 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-20 10:16:47,349 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 10:16:47,349 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-20 10:16:47,349 INFO L796 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-20 10:16:47,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:47,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-11-20 10:16:47,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:47,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45309393] [2019-11-20 10:16:47,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:47,974 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-20 10:16:47,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45309393] [2019-11-20 10:16:47,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352966127] [2019-11-20 10:16:47,974 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:48,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 10:16:48,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:16:48,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 10:16:48,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:48,041 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|, v_prenex_2], 1=[|v_#valid_44|]} [2019-11-20 10:16:48,045 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 10:16:48,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:16:48,069 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-11-20 10:16:48,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:16:48,078 INFO L377 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-20 10:16:48,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:16:48,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:16:48,101 INFO L377 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-20 10:16:48,102 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:16:48,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:16:48,119 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-20 10:16:48,119 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2019-11-20 10:16:48,351 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-20 10:16:48,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:16:48,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-20 10:16:48,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183967165] [2019-11-20 10:16:48,353 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:16:48,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:48,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2019-11-20 10:16:48,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:48,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302446631] [2019-11-20 10:16:48,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:48,361 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:48,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:48,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 10:16:48,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:16:48,434 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand 13 states. [2019-11-20 10:16:48,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:48,910 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-20 10:16:48,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:16:48,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-20 10:16:48,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 10:16:48,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-11-20 10:16:48,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 10:16:48,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 10:16:48,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-11-20 10:16:48,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:16:48,912 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-20 10:16:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-11-20 10:16:48,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-20 10:16:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-20 10:16:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-11-20 10:16:48,915 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-20 10:16:48,915 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-20 10:16:48,915 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 10:16:48,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2019-11-20 10:16:48,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 10:16:48,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:16:48,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:16:48,916 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-20 10:16:48,916 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 10:16:48,916 INFO L794 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 341#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; 342#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; 353#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; 354#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 355#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; 359#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 358#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; 357#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 356#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 349#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); 343#L24-3 [2019-11-20 10:16:48,917 INFO L796 eck$LassoCheckResult]: Loop: 343#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; 345#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 343#L24-3 [2019-11-20 10:16:48,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:48,917 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-11-20 10:16:48,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:48,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332355102] [2019-11-20 10:16:48,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:49,617 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-20 10:16:49,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332355102] [2019-11-20 10:16:49,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913692668] [2019-11-20 10:16:49,617 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:49,663 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 10:16:49,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:16:49,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 10:16:49,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:49,673 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_3, |v_#length_33|], 1=[|v_#valid_46|]} [2019-11-20 10:16:49,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:16:49,690 INFO L377 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 36 treesize of output 37 [2019-11-20 10:16:49,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:16:49,724 INFO L567 ElimStorePlain]: treesize reduction 47, result has 40.5 percent of original size [2019-11-20 10:16:49,724 INFO L464 ElimStorePlain]: Eliminatee |v_#length_33| vanished before elimination [2019-11-20 10:16:49,731 INFO L377 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-20 10:16:49,732 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:16:49,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:16:49,748 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-20 10:16:49,748 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:28 [2019-11-20 10:16:49,937 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-11-20 10:16:49,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:16:49,955 INFO L567 ElimStorePlain]: treesize reduction 7, result has 61.1 percent of original size [2019-11-20 10:16:49,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:16:49,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:7 [2019-11-20 10:16:50,010 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-20 10:16:50,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:16:50,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-20 10:16:50,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673035307] [2019-11-20 10:16:50,011 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:16:50,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:50,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2019-11-20 10:16:50,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:50,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254457524] [2019-11-20 10:16:50,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:50,019 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:50,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:50,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 10:16:50,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-11-20 10:16:50,077 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand 15 states. [2019-11-20 10:16:50,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:50,366 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-11-20 10:16:50,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 10:16:50,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2019-11-20 10:16:50,368 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 10:16:50,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2019-11-20 10:16:50,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 10:16:50,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 10:16:50,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2019-11-20 10:16:50,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:16:50,369 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-20 10:16:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2019-11-20 10:16:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-20 10:16:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-20 10:16:50,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-11-20 10:16:50,370 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-20 10:16:50,371 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-20 10:16:50,371 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 10:16:50,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2019-11-20 10:16:50,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-20 10:16:50,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:16:50,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:16:50,372 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-11-20 10:16:50,372 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 10:16:50,372 INFO L794 eck$LassoCheckResult]: Stem: 440#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-20 10:16:50,372 INFO L796 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-20 10:16:50,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:50,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-11-20 10:16:50,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:50,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388084997] [2019-11-20 10:16:50,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:50,408 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:50,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:50,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2019-11-20 10:16:50,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:50,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539031620] [2019-11-20 10:16:50,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:50,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:50,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:50,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2019-11-20 10:16:50,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:50,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444903993] [2019-11-20 10:16:50,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:50,476 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:51,773 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 151 DAG size of output: 118 [2019-11-20 10:16:52,342 WARN L191 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-11-20 10:16:52,344 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 10:16:52,344 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 10:16:52,344 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 10:16:52,344 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 10:16:52,344 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 10:16:52,344 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:52,344 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 10:16:52,345 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 10:16:52,345 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration7_Lasso [2019-11-20 10:16:52,345 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 10:16:52,345 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 10:16:52,347 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-20 10:16:52,357 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-20 10:16:52,359 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-20 10:16:52,361 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-20 10:16:52,363 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-20 10:16:52,370 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-20 10:16:52,372 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-20 10:16:52,486 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-20 10:16:52,489 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-20 10:16:52,491 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-20 10:16:52,493 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-20 10:16:52,495 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-20 10:16:52,497 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-20 10:16:52,714 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-20 10:16:52,896 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 10:16:52,896 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:52,904 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-20 10:16:52,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:52,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:16:52,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:52,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:52,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:52,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:16:52,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 10:16:52,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:52,925 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-20 10:16:52,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:52,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:16:52,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:52,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:52,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:52,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:16:52,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 10:16:52,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:52,933 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-20 10:16:52,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:52,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:16:52,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:52,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:52,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:52,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:16:52,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 10:16:52,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:52,940 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-20 10:16:52,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:52,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:16:52,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:52,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:52,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:52,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:16:52,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 10:16:52,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:52,958 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-20 10:16:52,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:52,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:52,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:52,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:52,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:16:52,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 10:16:52,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:16:52,981 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-20 10:16:52,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:52,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:16:52,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:52,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:52,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:52,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:16:52,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:52,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:16:52,998 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-20 10:16:53,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:53,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:53,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:53,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:53,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:16:53,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:53,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:16:53,015 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-20 10:16:53,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:16:53,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:16:53,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:16:53,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:16:53,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:16:53,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:53,053 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 10:16:53,103 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-11-20 10:16:53,103 INFO L444 ModelExtractionUtils]: 4 out of 25 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:16:53,107 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 10:16:53,109 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 10:16:53,109 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 10:16:53,109 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#str2~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_2) = -1*ULTIMATE.start_main_~#str2~0.offset - 1*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_2 Supporting invariants [] [2019-11-20 10:16:53,118 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-20 10:16:53,120 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 10:16:53,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:53,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:16:53,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:53,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 10:16:53,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:53,163 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-20 10:16:53,164 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-20 10:16:53,164 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-20 10:16:53,178 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 29 transitions. Complement of second has 5 states. [2019-11-20 10:16:53,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-20 10:16:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 10:16:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-11-20 10:16:53,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-20 10:16:53,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:16:53,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-20 10:16:53,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:16:53,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-20 10:16:53,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:16:53,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2019-11-20 10:16:53,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 10:16:53,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 27 transitions. [2019-11-20 10:16:53,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-20 10:16:53,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-20 10:16:53,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-11-20 10:16:53,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 10:16:53,186 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-20 10:16:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-11-20 10:16:53,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-20 10:16:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-20 10:16:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-11-20 10:16:53,188 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-20 10:16:53,188 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-20 10:16:53,188 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 10:16:53,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2019-11-20 10:16:53,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 10:16:53,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:16:53,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:16:53,190 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:53,190 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 10:16:53,190 INFO L794 eck$LassoCheckResult]: Stem: 568#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 562#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; 563#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; 575#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 576#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; 577#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);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 579#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 578#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 572#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); 573#L24-3 assume !(main_~i~0 >= 0); 565#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; 569#L30-3 [2019-11-20 10:16:53,190 INFO L796 eck$LassoCheckResult]: Loop: 569#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; 570#L4 assume !(0 == __VERIFIER_assert_~cond); 574#L4-2 havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 571#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 569#L30-3 [2019-11-20 10:16:53,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:53,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425437, now seen corresponding path program 1 times [2019-11-20 10:16:53,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:53,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497417619] [2019-11-20 10:16:53,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:53,225 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-20 10:16:53,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497417619] [2019-11-20 10:16:53,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:53,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:16:53,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71667994] [2019-11-20 10:16:53,226 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:16:53,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:53,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 1 times [2019-11-20 10:16:53,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:53,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32234159] [2019-11-20 10:16:53,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:53,234 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:53,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:53,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:16:53,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:16:53,356 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-20 10:16:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:53,376 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-11-20 10:16:53,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:16:53,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2019-11-20 10:16:53,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 10:16:53,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2019-11-20 10:16:53,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 10:16:53,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 10:16:53,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2019-11-20 10:16:53,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 10:16:53,378 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-20 10:16:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2019-11-20 10:16:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-20 10:16:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-20 10:16:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-11-20 10:16:53,380 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-20 10:16:53,380 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-20 10:16:53,380 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 10:16:53,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2019-11-20 10:16:53,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 10:16:53,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:16:53,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:16:53,381 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:53,381 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 10:16:53,382 INFO L794 eck$LassoCheckResult]: Stem: 622#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 617#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; 618#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; 629#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 630#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; 631#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 639#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; 638#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 637#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; 636#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 635#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; 634#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 633#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 627#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); 619#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; 620#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 625#L24-3 assume !(main_~i~0 >= 0); 632#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; 623#L30-3 [2019-11-20 10:16:53,382 INFO L796 eck$LassoCheckResult]: Loop: 623#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; 624#L4 assume !(0 == __VERIFIER_assert_~cond); 628#L4-2 havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 626#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 623#L30-3 [2019-11-20 10:16:53,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:53,382 INFO L82 PathProgramCache]: Analyzing trace with hash -743540257, now seen corresponding path program 1 times [2019-11-20 10:16:53,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:53,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454034209] [2019-11-20 10:16:53,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:53,492 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-20 10:16:53,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454034209] [2019-11-20 10:16:53,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252262156] [2019-11-20 10:16:53,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:53,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 10:16:53,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:53,581 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-20 10:16:53,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:16:53,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-20 10:16:53,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212731213] [2019-11-20 10:16:53,582 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:16:53,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:53,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 2 times [2019-11-20 10:16:53,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:53,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486207169] [2019-11-20 10:16:53,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:53,591 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:53,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:53,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:16:53,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:16:53,733 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-11-20 10:16:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:53,828 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-11-20 10:16:53,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:16:53,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2019-11-20 10:16:53,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 10:16:53,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 29 transitions. [2019-11-20 10:16:53,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 10:16:53,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 10:16:53,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2019-11-20 10:16:53,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 10:16:53,830 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-11-20 10:16:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2019-11-20 10:16:53,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-20 10:16:53,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-20 10:16:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-20 10:16:53,832 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-20 10:16:53,832 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-20 10:16:53,832 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-20 10:16:53,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2019-11-20 10:16:53,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 10:16:53,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:16:53,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:16:53,833 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:53,833 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 10:16:53,834 INFO L794 eck$LassoCheckResult]: Stem: 739#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 733#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; 734#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; 745#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 746#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; 747#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 748#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; 756#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 755#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; 754#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 753#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; 751#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 750#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 742#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); 735#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; 736#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 737#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; 738#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 752#L24-3 assume !(main_~i~0 >= 0); 749#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; 740#L30-3 [2019-11-20 10:16:53,834 INFO L796 eck$LassoCheckResult]: Loop: 740#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; 741#L4 assume !(0 == __VERIFIER_assert_~cond); 744#L4-2 havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 743#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 740#L30-3 [2019-11-20 10:16:53,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:53,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1577559391, now seen corresponding path program 2 times [2019-11-20 10:16:53,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:53,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479942783] [2019-11-20 10:16:53,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:54,017 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-20 10:16:54,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479942783] [2019-11-20 10:16:54,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067134877] [2019-11-20 10:16:54,017 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:54,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 10:16:54,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:16:54,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 10:16:54,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:54,121 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-20 10:16:54,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:16:54,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-11-20 10:16:54,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359467911] [2019-11-20 10:16:54,121 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:16:54,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:54,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 3 times [2019-11-20 10:16:54,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:54,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441421079] [2019-11-20 10:16:54,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:54,129 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:54,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:54,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 10:16:54,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-20 10:16:54,232 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 5 Second operand 11 states. [2019-11-20 10:16:54,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:54,352 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-11-20 10:16:54,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 10:16:54,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 32 transitions. [2019-11-20 10:16:54,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 10:16:54,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 31 transitions. [2019-11-20 10:16:54,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 10:16:54,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-20 10:16:54,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2019-11-20 10:16:54,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 10:16:54,354 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-20 10:16:54,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2019-11-20 10:16:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-20 10:16:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 10:16:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-20 10:16:54,356 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-20 10:16:54,356 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-20 10:16:54,356 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-20 10:16:54,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2019-11-20 10:16:54,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 10:16:54,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:16:54,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:16:54,357 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:54,357 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 10:16:54,357 INFO L794 eck$LassoCheckResult]: Stem: 871#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 865#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; 866#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; 878#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 879#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; 880#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 890#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; 889#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 888#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; 887#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 886#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; 883#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 882#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 875#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); 867#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; 868#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 869#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; 870#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 874#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; 885#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 884#L24-3 assume !(main_~i~0 >= 0); 881#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; 872#L30-3 [2019-11-20 10:16:54,358 INFO L796 eck$LassoCheckResult]: Loop: 872#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; 873#L4 assume !(0 == __VERIFIER_assert_~cond); 877#L4-2 havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 876#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 872#L30-3 [2019-11-20 10:16:54,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:54,358 INFO L82 PathProgramCache]: Analyzing trace with hash 88937187, now seen corresponding path program 3 times [2019-11-20 10:16:54,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:54,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418416223] [2019-11-20 10:16:54,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:54,528 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-20 10:16:54,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418416223] [2019-11-20 10:16:54,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012195548] [2019-11-20 10:16:54,528 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d586565d-de10-46da-a1a7-21949ef13d5b/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:54,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 10:16:54,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:16:54,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 10:16:54,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:54,591 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_4, |v_#length_57|], 1=[|v_#valid_78|]} [2019-11-20 10:16:54,594 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 10:16:54,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:16:54,608 INFO L567 ElimStorePlain]: treesize reduction 5, result has 84.8 percent of original size [2019-11-20 10:16:54,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:16:54,612 INFO L377 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-20 10:16:54,612 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:16:54,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:16:54,624 INFO L377 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-20 10:16:54,624 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:16:54,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:16:54,633 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-20 10:16:54,633 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:72, output treesize:25 [2019-11-20 10:16:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 10:16:54,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:16:54,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-20 10:16:54,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969201351] [2019-11-20 10:16:54,832 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:16:54,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:54,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 4 times [2019-11-20 10:16:54,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:54,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242033266] [2019-11-20 10:16:54,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:54,840 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:54,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:54,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 10:16:54,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-20 10:16:54,964 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 5 Second operand 15 states. [2019-11-20 10:16:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:55,479 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-11-20 10:16:55,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 10:16:55,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 51 transitions. [2019-11-20 10:16:55,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 10:16:55,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 49 transitions. [2019-11-20 10:16:55,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-20 10:16:55,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-20 10:16:55,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 49 transitions. [2019-11-20 10:16:55,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 10:16:55,482 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-11-20 10:16:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 49 transitions. [2019-11-20 10:16:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2019-11-20 10:16:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 10:16:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-20 10:16:55,484 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-20 10:16:55,484 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-20 10:16:55,484 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-20 10:16:55,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2019-11-20 10:16:55,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-20 10:16:55,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:16:55,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:16:55,485 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:55,485 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 10:16:55,486 INFO L794 eck$LassoCheckResult]: Stem: 1043#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1037#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; 1038#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; 1049#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1050#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; 1051#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1062#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; 1061#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1060#L16-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet1, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1059#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1058#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; 1054#L16-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1053#L16-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1047#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); 1039#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; 1040#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1041#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; 1042#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1066#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; 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; 1063#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1057#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; 1056#L24-2 main_#t~post2 := main_~i~0;main_~i~0 := main_#t~post2 - 1;havoc main_#t~post2; 1055#L24-3 assume !(main_~i~0 >= 0); 1052#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; 1044#L30-3 [2019-11-20 10:16:55,486 INFO L796 eck$LassoCheckResult]: Loop: 1044#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; 1045#L4 assume !(0 == __VERIFIER_assert_~cond); 1048#L4-2 havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post8 := main_~j~0;main_~j~0 := main_#t~post8 - 1;havoc main_#t~post8; 1046#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 1044#L30-3 [2019-11-20 10:16:55,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:55,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1540388377, now seen corresponding path program 4 times [2019-11-20 10:16:55,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:55,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118869945] [2019-11-20 10:16:55,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:55,589 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:55,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 5 times [2019-11-20 10:16:55,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:55,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781919566] [2019-11-20 10:16:55,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:55,602 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:16:55,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:55,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1945357456, now seen corresponding path program 1 times [2019-11-20 10:16:55,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:55,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459474598] [2019-11-20 10:16:55,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:16:55,694 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:17:02,930 WARN L191 SmtUtils]: Spent 7.09 s on a formula simplification. DAG size of input: 270 DAG size of output: 199 [2019-11-20 10:17:04,988 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 150 DAG size of output: 109 [2019-11-20 10:17:04,990 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 10:17:04,990 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 10:17:04,990 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 10:17:04,990 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 10:17:04,991 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 10:17:04,991 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:17:04,991 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 10:17:04,991 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 10:17:04,991 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration12_Lasso [2019-11-20 10:17:04,991 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 10:17:04,991 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 10:17:04,994 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-20 10:17:05,001 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-20 10:17:05,003 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-20 10:17:05,006 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-20 10:17:05,009 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-20 10:17:05,011 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-20 10:17:05,230 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:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java: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-20 10:17:05,233 INFO L168 Benchmark]: Toolchain (without parser) took 21835.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 948.7 MB in the beginning and 821.9 MB in the end (delta: 126.8 MB). Peak memory consumption was 327.0 MB. Max. memory is 11.5 GB. [2019-11-20 10:17:05,233 INFO L168 Benchmark]: CDTParser took 0.22 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-20 10:17:05,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-20 10:17:05,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:17:05,234 INFO L168 Benchmark]: Boogie Preprocessor took 26.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:17:05,235 INFO L168 Benchmark]: RCFGBuilder took 311.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:17:05,235 INFO L168 Benchmark]: BuchiAutomizer took 21086.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 101.2 MB). Free memory was 1.1 GB in the beginning and 821.9 MB in the end (delta: 248.3 MB). Peak memory consumption was 349.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:17:05,244 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.22 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 365.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 311.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21086.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 101.2 MB). Free memory was 1.1 GB in the beginning and 821.9 MB in the end (delta: 248.3 MB). Peak memory consumption was 349.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...