./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/invert_string-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/invert_string-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/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 4335483d0b28de4d854f33f949d3555a767d1bde .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:20,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:20,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:20,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:20,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:20,138 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:20,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:20,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:20,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:20,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:20,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:20,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:20,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:20,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:20,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:20,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:20,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:20,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:20,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:20,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:20,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:20,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:20,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:20,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:20,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:20,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:20,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:20,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:20,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:20,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:20,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:20,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:20,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:20,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:20,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:20,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:20,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:20,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:20,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:20,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:20,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:20,164 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:54:20,177 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:20,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:20,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:20,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:20,178 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:20,179 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:20,179 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:20,179 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:20,179 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:20,179 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:20,179 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:20,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:20,180 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:20,180 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:20,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:20,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:20,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:20,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:20,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:20,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:20,181 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:20,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:20,181 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:20,182 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:20,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:20,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:20,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:20,182 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:20,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:20,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:20,183 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:20,187 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:20,187 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/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 -> 4335483d0b28de4d854f33f949d3555a767d1bde [2019-10-22 08:54:20,211 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:20,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:20,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:20,225 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:20,225 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:20,226 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/bin/uautomizer/../../sv-benchmarks/c/loops/invert_string-1.c [2019-10-22 08:54:20,268 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/bin/uautomizer/data/f43d31ad3/2b7df67678394c7991b4ef306a5e6d13/FLAG5f230cb21 [2019-10-22 08:54:20,650 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:20,651 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/sv-benchmarks/c/loops/invert_string-1.c [2019-10-22 08:54:20,655 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/bin/uautomizer/data/f43d31ad3/2b7df67678394c7991b4ef306a5e6d13/FLAG5f230cb21 [2019-10-22 08:54:21,057 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/bin/uautomizer/data/f43d31ad3/2b7df67678394c7991b4ef306a5e6d13 [2019-10-22 08:54:21,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:21,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:21,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:21,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:21,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:21,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:21" (1/1) ... [2019-10-22 08:54:21,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4259045b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:21, skipping insertion in model container [2019-10-22 08:54:21,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:21" (1/1) ... [2019-10-22 08:54:21,075 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:21,093 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:21,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:21,282 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:21,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:21,378 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:21,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:21 WrapperNode [2019-10-22 08:54:21,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:21,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:21,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:21,380 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:21,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:21" (1/1) ... [2019-10-22 08:54:21,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:21" (1/1) ... [2019-10-22 08:54:21,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:21,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:21,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:21,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:21,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:21" (1/1) ... [2019-10-22 08:54:21,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:21" (1/1) ... [2019-10-22 08:54:21,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:21" (1/1) ... [2019-10-22 08:54:21,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:21" (1/1) ... [2019-10-22 08:54:21,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:21" (1/1) ... [2019-10-22 08:54:21,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:21" (1/1) ... [2019-10-22 08:54:21,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:21" (1/1) ... [2019-10-22 08:54:21,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:21,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:21,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:21,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:21,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:21,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:21,680 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:21,681 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 08:54:21,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:21 BoogieIcfgContainer [2019-10-22 08:54:21,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:21,683 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:21,683 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:21,686 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:21,687 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:21,687 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:21" (1/3) ... [2019-10-22 08:54:21,688 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1afaefe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:21, skipping insertion in model container [2019-10-22 08:54:21,688 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:21,688 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:21" (2/3) ... [2019-10-22 08:54:21,689 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1afaefe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:21, skipping insertion in model container [2019-10-22 08:54:21,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:21,689 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:21" (3/3) ... [2019-10-22 08:54:21,690 INFO L371 chiAutomizerObserver]: Analyzing ICFG invert_string-1.c [2019-10-22 08:54:21,733 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:21,733 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:21,733 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:21,733 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:21,734 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:21,734 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:21,734 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:21,734 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:21,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:54:21,799 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:54:21,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:21,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:21,810 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:21,810 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:21,810 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:21,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:54:21,811 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:54:21,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:21,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:21,813 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:21,813 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:21,821 INFO L791 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 6#L20-3true [2019-10-22 08:54:21,822 INFO L793 eck$LassoCheckResult]: Loop: 6#L20-3true assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 7#L20-2true main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 6#L20-3true [2019-10-22 08:54:21,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:21,828 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:54:21,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:21,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560525558] [2019-10-22 08:54:21,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:21,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:21,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:21,976 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:21,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:21,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-10-22 08:54:21,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:21,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886779070] [2019-10-22 08:54:21,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:21,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:21,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:21,991 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:21,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:21,993 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-10-22 08:54:21,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:21,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254971202] [2019-10-22 08:54:21,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:21,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:21,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:22,041 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:22,326 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-22 08:54:22,337 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:22,337 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:22,338 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:22,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:22,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:22,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:22,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:22,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:22,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration1_Lasso [2019-10-22 08:54:22,339 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:22,339 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:22,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,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-10-22 08:54:22,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:22,755 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:22,759 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:22,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,763 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,763 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,763 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,764 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,765 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,765 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,768 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,768 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,768 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,768 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,769 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,769 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,769 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,773 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,774 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,782 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,783 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,783 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,785 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,785 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,785 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,786 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,786 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,789 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,789 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,790 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,790 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,792 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,801 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,801 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,805 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,806 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,806 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,806 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,806 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,806 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,806 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,815 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,815 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,815 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,815 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,816 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,816 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,816 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,818 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,818 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,821 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,822 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,825 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,826 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,826 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,826 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,830 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,830 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,848 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,849 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:22,849 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,856 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,858 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,919 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:22,964 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:54:22,969 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:54:22,971 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:22,973 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:22,973 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:22,974 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1, ULTIMATE.start_main_~#str1~0.offset) = -1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1 - 1*ULTIMATE.start_main_~#str1~0.offset Supporting invariants [] [2019-10-22 08:54:22,986 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:54:22,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:23,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:23,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:23,081 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:54:23,082 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-10-22 08:54:23,140 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 8 states. [2019-10-22 08:54:23,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-10-22 08:54:23,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2019-10-22 08:54:23,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:54:23,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2019-10-22 08:54:23,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:23,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2019-10-22 08:54:23,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:54:23,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2019-10-22 08:54:23,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:54:23,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:54:23,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-10-22 08:54:23,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:23,165 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:54:23,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-10-22 08:54:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-22 08:54:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:54:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-10-22 08:54:23,190 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:54:23,190 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:54:23,190 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:23,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-10-22 08:54:23,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:54:23,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:23,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:23,192 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:54:23,192 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:23,192 INFO L791 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 112#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 107#L20-3 assume !(main_~i~0 < main_~MAX~0); 105#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 106#L27-3 [2019-10-22 08:54:23,192 INFO L793 eck$LassoCheckResult]: Loop: 106#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 115#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 106#L27-3 [2019-10-22 08:54:23,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,193 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-10-22 08:54:23,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:23,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472578875] [2019-10-22 08:54:23,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:23,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472578875] [2019-10-22 08:54:23,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:23,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:23,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052927248] [2019-10-22 08:54:23,255 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:23,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2019-10-22 08:54:23,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:23,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909243754] [2019-10-22 08:54:23,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:23,272 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:23,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:23,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:23,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:23,344 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 08:54:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:23,373 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-10-22 08:54:23,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:23,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-10-22 08:54:23,375 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:54:23,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2019-10-22 08:54:23,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:54:23,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:54:23,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-10-22 08:54:23,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:23,376 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-10-22 08:54:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-10-22 08:54:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-10-22 08:54:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:54:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-10-22 08:54:23,378 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-10-22 08:54:23,378 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-10-22 08:54:23,378 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:23,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2019-10-22 08:54:23,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:54:23,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:23,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:23,379 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:23,379 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:23,380 INFO L791 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 139#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 140#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 146#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 147#L20-3 assume !(main_~i~0 < main_~MAX~0); 144#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 145#L27-3 [2019-10-22 08:54:23,381 INFO L793 eck$LassoCheckResult]: Loop: 145#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 149#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 145#L27-3 [2019-10-22 08:54:23,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-10-22 08:54:23,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:23,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815869575] [2019-10-22 08:54:23,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:23,433 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:23,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2019-10-22 08:54:23,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:23,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860230868] [2019-10-22 08:54:23,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:23,452 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:23,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,453 INFO L82 PathProgramCache]: Analyzing trace with hash 265181135, now seen corresponding path program 1 times [2019-10-22 08:54:23,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:23,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225256146] [2019-10-22 08:54:23,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:23,507 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:23,737 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-10-22 08:54:23,925 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-10-22 08:54:23,928 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:23,928 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:23,928 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:23,928 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:23,928 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:23,928 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:23,928 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:23,929 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:23,929 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration3_Lasso [2019-10-22 08:54:23,929 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:23,929 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:23,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:23,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:23,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:23,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:24,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:24,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:24,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:24,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:24,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:24,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:24,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:24,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:24,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:24,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:24,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:24,438 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:24,438 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:24,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,439 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,439 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,440 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,441 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,441 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,441 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,445 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,445 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:24,445 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,445 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,445 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,446 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:24,446 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:24,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,447 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,447 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,447 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,447 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,450 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:24,450 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,453 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,455 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:24,455 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,462 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:24,462 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,462 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,464 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:24,464 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:24,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:24,474 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:24,474 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:24,474 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:24,475 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:24,483 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:24,483 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:24,524 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:24,559 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:54:24,559 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:24,560 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:24,561 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:54:24,561 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:24,561 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~MAX~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~MAX~0 + 2*ULTIMATE.start_main_~i~0 Supporting invariants [1*ULTIMATE.start_main_~MAX~0 - 1 >= 0] [2019-10-22 08:54:24,571 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 08:54:24,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:24,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:54:24,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:24,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:24,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:24,649 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-10-22 08:54:24,649 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 08:54:24,692 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 16 states and 21 transitions. Complement of second has 8 states. [2019-10-22 08:54:24,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-10-22 08:54:24,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:54:24,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:24,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 8 letters. Loop has 2 letters. [2019-10-22 08:54:24,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:24,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:54:24,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:24,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2019-10-22 08:54:24,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:24,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 17 transitions. [2019-10-22 08:54:24,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:54:24,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:54:24,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-10-22 08:54:24,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:24,697 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 08:54:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-10-22 08:54:24,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-22 08:54:24,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:54:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-10-22 08:54:24,698 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 08:54:24,698 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 08:54:24,698 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:24,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-10-22 08:54:24,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:24,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:24,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:24,699 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:24,699 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:54:24,699 INFO L791 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 239#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 240#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 246#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 247#L20-3 assume !(main_~i~0 < main_~MAX~0); 244#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 245#L27-3 assume !(main_~i~0 >= 0); 248#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 238#L33-3 [2019-10-22 08:54:24,700 INFO L793 eck$LassoCheckResult]: Loop: 238#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 241#L5 assume !(0 == __VERIFIER_assert_~cond); 242#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 237#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 238#L33-3 [2019-10-22 08:54:24,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:24,705 INFO L82 PathProgramCache]: Analyzing trace with hash 265181077, now seen corresponding path program 1 times [2019-10-22 08:54:24,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:24,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846443085] [2019-10-22 08:54:24,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:24,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:24,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:54:24,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846443085] [2019-10-22 08:54:24,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:24,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:24,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88368588] [2019-10-22 08:54:24,739 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:24,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:24,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 1 times [2019-10-22 08:54:24,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:24,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709245816] [2019-10-22 08:54:24,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:24,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:24,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:24,749 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:24,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:24,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:24,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:24,864 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-10-22 08:54:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:24,899 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-10-22 08:54:24,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:24,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2019-10-22 08:54:24,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:24,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2019-10-22 08:54:24,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:54:24,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:54:24,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-10-22 08:54:24,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:24,901 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-10-22 08:54:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-10-22 08:54:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-22 08:54:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:54:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-10-22 08:54:24,903 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-10-22 08:54:24,903 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-10-22 08:54:24,903 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:54:24,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-10-22 08:54:24,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:24,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:24,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:24,907 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:24,907 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:54:24,907 INFO L791 eck$LassoCheckResult]: Stem: 280#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 274#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 275#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 283#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 284#L20-3 assume !(main_~i~0 < main_~MAX~0); 281#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 282#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 286#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 287#L27-3 assume !(main_~i~0 >= 0); 285#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 277#L33-3 [2019-10-22 08:54:24,907 INFO L793 eck$LassoCheckResult]: Loop: 277#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 278#L5 assume !(0 == __VERIFIER_assert_~cond); 279#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 276#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 277#L33-3 [2019-10-22 08:54:24,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:24,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1436000983, now seen corresponding path program 1 times [2019-10-22 08:54:24,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:24,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949008528] [2019-10-22 08:54:24,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:24,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:24,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:24,945 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:24,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:24,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 2 times [2019-10-22 08:54:24,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:24,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151032221] [2019-10-22 08:54:24,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:24,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:24,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:24,954 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:24,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1461824416, now seen corresponding path program 1 times [2019-10-22 08:54:24,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:24,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35151865] [2019-10-22 08:54:24,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:24,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:24,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:25,001 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:25,385 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2019-10-22 08:54:25,552 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-10-22 08:54:25,553 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:25,553 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:25,553 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:25,554 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:25,554 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:25,554 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:25,554 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:25,554 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:25,554 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration5_Lasso [2019-10-22 08:54:25,554 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:25,554 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:25,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:26,077 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:26,077 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:26,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:26,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:26,078 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:26,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:26,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:26,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:26,079 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:26,079 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:26,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:26,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:26,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:26,080 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:26,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:26,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:26,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:26,081 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:26,081 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:26,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:26,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:26,082 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:26,082 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:26,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:26,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:26,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:26,083 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:26,083 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:26,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:26,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:26,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:26,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:26,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:26,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:26,086 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:26,086 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:26,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:26,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:26,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:26,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:26,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:26,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:26,089 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:26,089 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:26,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:26,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:26,092 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:26,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:26,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:26,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:26,095 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:26,095 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:26,113 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:26,126 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:26,127 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:54:26,127 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:26,127 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:26,128 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:26,128 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2019-10-22 08:54:26,143 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 08:54:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:26,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:26,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:26,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:26,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:26,281 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-10-22 08:54:26,281 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-10-22 08:54:26,420 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 32 states and 37 transitions. Complement of second has 10 states. [2019-10-22 08:54:26,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2019-10-22 08:54:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:54:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2019-10-22 08:54:26,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:54:26,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:26,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 14 letters. Loop has 4 letters. [2019-10-22 08:54:26,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:26,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 8 letters. [2019-10-22 08:54:26,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:26,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-10-22 08:54:26,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:26,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 19 states and 21 transitions. [2019-10-22 08:54:26,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:54:26,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:54:26,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2019-10-22 08:54:26,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:26,424 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-22 08:54:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2019-10-22 08:54:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-10-22 08:54:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:54:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-10-22 08:54:26,426 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-10-22 08:54:26,426 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-10-22 08:54:26,426 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:54:26,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2019-10-22 08:54:26,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:26,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:26,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:26,427 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:26,428 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:54:26,428 INFO L791 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 423#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 424#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 430#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 431#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 432#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 436#L20-3 assume !(main_~i~0 < main_~MAX~0); 427#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 428#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 434#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 435#L27-3 assume !(main_~i~0 >= 0); 433#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 422#L33-3 [2019-10-22 08:54:26,428 INFO L793 eck$LassoCheckResult]: Loop: 422#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 425#L5 assume !(0 == __VERIFIER_assert_~cond); 426#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 421#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 422#L33-3 [2019-10-22 08:54:26,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:26,428 INFO L82 PathProgramCache]: Analyzing trace with hash 780803417, now seen corresponding path program 2 times [2019-10-22 08:54:26,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:26,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105991316] [2019-10-22 08:54:26,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:26,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105991316] [2019-10-22 08:54:26,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708253114] [2019-10-22 08:54:26,545 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01d4b3b8-3dba-4005-97da-50849a4116c1/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:26,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:54:26,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:54:26,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:26,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:26,617 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:26,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 10 [2019-10-22 08:54:26,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699766045] [2019-10-22 08:54:26,618 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:26,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:26,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 3 times [2019-10-22 08:54:26,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:26,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279163135] [2019-10-22 08:54:26,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:26,626 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:26,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:26,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:54:26,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:54:26,751 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2019-10-22 08:54:26,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:26,871 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-10-22 08:54:26,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:54:26,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2019-10-22 08:54:26,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:26,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2019-10-22 08:54:26,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:54:26,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:54:26,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2019-10-22 08:54:26,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:26,875 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-22 08:54:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2019-10-22 08:54:26,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-10-22 08:54:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:54:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-22 08:54:26,876 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-22 08:54:26,876 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-22 08:54:26,876 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:54:26,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-10-22 08:54:26,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:26,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:26,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:26,877 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:26,877 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:54:26,877 INFO L791 eck$LassoCheckResult]: Stem: 523#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 519#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_#t~mem5, main_#t~post6, main_#t~post4, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~post7, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet1 % 4294967296 % 4294967296 else main_#t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet1;assume 0 != (if main_~MAX~0 > 0 then 1 else 0);call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 520#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 526#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 527#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet3, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet3; 528#L20-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 534#L20-3 assume !(main_~i~0 < main_~MAX~0); 524#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 525#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 530#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 531#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem5 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem5, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem5;main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 532#L27-2 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 - 1;havoc main_#t~post4; 533#L27-3 assume !(main_~i~0 >= 0); 529#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 518#L33-3 [2019-10-22 08:54:26,877 INFO L793 eck$LassoCheckResult]: Loop: 518#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem8 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem9 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem8 == main_#t~mem9 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 521#L5 assume !(0 == __VERIFIER_assert_~cond); 522#L5-2 havoc main_#t~mem8;havoc main_#t~mem9;main_#t~post10 := main_~j~0;main_~j~0 := main_#t~post10 - 1;havoc main_#t~post10; 517#L33-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 518#L33-3 [2019-10-22 08:54:26,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:26,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1267136613, now seen corresponding path program 3 times [2019-10-22 08:54:26,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:26,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13685628] [2019-10-22 08:54:26,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:26,907 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:26,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:26,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 4 times [2019-10-22 08:54:26,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:26,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795838298] [2019-10-22 08:54:26,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:26,921 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:26,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:26,924 INFO L82 PathProgramCache]: Analyzing trace with hash 993507108, now seen corresponding path program 2 times [2019-10-22 08:54:26,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:26,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023969829] [2019-10-22 08:54:26,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:26,966 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:27,591 WARN L191 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 123 [2019-10-22 08:54:27,775 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-10-22 08:54:27,777 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:27,777 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:27,777 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:27,777 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:27,777 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:27,777 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:27,777 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:27,777 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:27,777 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration7_Lasso [2019-10-22 08:54:27,777 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:27,777 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:27,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:27,869 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 08:54:27,874 INFO L168 Benchmark]: Toolchain (without parser) took 6813.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.6 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 144.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:27,874 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:27,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:27,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.25 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-10-22 08:54:27,875 INFO L168 Benchmark]: Boogie Preprocessor took 20.23 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-10-22 08:54:27,876 INFO L168 Benchmark]: RCFGBuilder took 247.46 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:27,877 INFO L168 Benchmark]: BuchiAutomizer took 6190.22 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.9 MB). Peak memory consumption was 164.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:27,879 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.25 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 20.23 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. * RCFGBuilder took 247.46 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6190.22 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.9 MB). Peak memory consumption was 164.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...