./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 64bit --witnessprinter.graph.data.programhash 4f531da4514da78f664dbd663145b26ee24930c7e93acdc31160c6cc4e4d5de8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:36:12,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:36:12,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:36:12,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:36:12,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:36:12,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:36:12,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:36:12,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:36:12,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:36:12,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:36:12,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:36:12,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:36:12,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:36:12,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:36:12,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:36:12,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:36:12,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:36:12,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:36:12,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:36:12,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:36:12,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:36:12,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:36:12,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:36:12,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:36:12,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:36:12,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:36:12,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:36:12,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:36:12,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:36:12,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:36:12,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:36:12,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:36:12,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:36:12,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:36:12,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:36:12,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:36:12,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:36:12,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:36:12,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:36:12,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:36:12,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:36:12,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:36:12,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:36:12,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:36:12,142 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:36:12,143 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:36:12,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:36:12,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:36:12,144 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:36:12,144 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:36:12,144 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:36:12,145 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:36:12,145 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:36:12,145 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:36:12,145 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:36:12,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:36:12,146 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:36:12,146 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:36:12,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:36:12,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:36:12,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:36:12,146 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:36:12,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:36:12,147 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:36:12,147 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:36:12,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:36:12,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:36:12,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:36:12,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:36:12,148 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:36:12,149 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:36:12,150 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f531da4514da78f664dbd663145b26ee24930c7e93acdc31160c6cc4e4d5de8 [2022-02-21 03:36:12,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:36:12,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:36:12,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:36:12,428 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:36:12,430 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:36:12,431 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2022-02-21 03:36:12,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bffbff2a4/35619a6493ee4deaba7ddcf37dbc3d28/FLAGda3c906d5 [2022-02-21 03:36:12,983 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:36:12,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2022-02-21 03:36:12,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bffbff2a4/35619a6493ee4deaba7ddcf37dbc3d28/FLAGda3c906d5 [2022-02-21 03:36:13,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bffbff2a4/35619a6493ee4deaba7ddcf37dbc3d28 [2022-02-21 03:36:13,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:36:13,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:36:13,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:13,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:36:13,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:36:13,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:13" (1/1) ... [2022-02-21 03:36:13,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a21b1be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:13, skipping insertion in model container [2022-02-21 03:36:13,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:13" (1/1) ... [2022-02-21 03:36:13,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:36:13,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:36:13,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:13,557 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:36:13,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:13,585 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:36:13,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:13 WrapperNode [2022-02-21 03:36:13,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:13,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:13,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:36:13,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:36:13,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:13" (1/1) ... [2022-02-21 03:36:13,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:13" (1/1) ... [2022-02-21 03:36:13,626 INFO L137 Inliner]: procedures = 13, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 32 [2022-02-21 03:36:13,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:13,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:36:13,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:36:13,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:36:13,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:13" (1/1) ... [2022-02-21 03:36:13,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:13" (1/1) ... [2022-02-21 03:36:13,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:13" (1/1) ... [2022-02-21 03:36:13,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:13" (1/1) ... [2022-02-21 03:36:13,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:13" (1/1) ... [2022-02-21 03:36:13,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:13" (1/1) ... [2022-02-21 03:36:13,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:13" (1/1) ... [2022-02-21 03:36:13,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:36:13,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:36:13,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:36:13,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:36:13,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:13" (1/1) ... [2022-02-21 03:36:13,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:13,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:13,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:13,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:36:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2022-02-21 03:36:13,751 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2022-02-21 03:36:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:36:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:36:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:36:13,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:36:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:36:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:36:13,818 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:36:13,823 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:36:14,026 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:36:14,033 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:36:14,055 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:36:14,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:14 BoogieIcfgContainer [2022-02-21 03:36:14,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:36:14,059 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:36:14,059 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:36:14,066 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:36:14,067 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:14,067 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:36:13" (1/3) ... [2022-02-21 03:36:14,077 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ba11d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:14, skipping insertion in model container [2022-02-21 03:36:14,078 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:14,078 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:13" (2/3) ... [2022-02-21 03:36:14,078 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ba11d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:14, skipping insertion in model container [2022-02-21 03:36:14,078 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:14,079 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:14" (3/3) ... [2022-02-21 03:36:14,080 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_strcopy_malloc.i [2022-02-21 03:36:14,120 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:36:14,120 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:36:14,120 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:36:14,120 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:36:14,120 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:36:14,120 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:36:14,120 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:36:14,120 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:36:14,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:14,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:14,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:14,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:14,167 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:36:14,168 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:14,168 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:36:14,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:14,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:14,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:14,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:14,173 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:36:14,173 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:14,180 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1.base, main_#t~ret6#1.offset, main_#t~ret7#1.base, main_#t~ret7#1.offset, main_~length~0#1, main_~original~0#1.base, main_~original~0#1.offset, main_~res~0#1.base, main_~res~0#1.offset;main_~length~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 16#L35true assume main_~length~0#1 < 1;main_~length~0#1 := 1; 14#L35-2true assume { :begin_inline_build_nondet_String } true;build_nondet_String_#in~length#1 := main_~length~0#1;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length#1 := build_nondet_String_#in~length#1;call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 17#L12true main_#t~ret6#1.base, main_#t~ret6#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~original~0#1.base, main_~original~0#1.offset := main_#t~ret6#1.base, main_#t~ret6#1.offset;havoc main_#t~ret6#1.base, main_#t~ret6#1.offset;assume { :begin_inline_rec_strcopy } true;rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset, rec_strcopy_#in~length#1 := main_~original~0#1.base, main_~original~0#1.offset, main_~length~0#1;havoc rec_strcopy_#res#1.base, rec_strcopy_#res#1.offset;havoc rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset, rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~length#1, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset;rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset := rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset;rec_strcopy_~length#1 := rec_strcopy_#in~length#1;call rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset := #Ultimate.allocOnHeap(rec_strcopy_~length#1);rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset := rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset;havoc rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset; 13#L28true call rec_strcopy_helper(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset);< 9#rec_strcopy_helperENTRYtrue [2022-02-21 03:36:14,180 INFO L793 eck$LassoCheckResult]: Loop: 9#rec_strcopy_helperENTRYtrue ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem2 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem2, ~dest.base, ~dest.offset, 1);havoc #t~mem2;call #t~mem3 := read~int(~source.base, ~source.offset, 1); 6#L21true assume 0 != #t~mem3;havoc #t~mem3; 15#L22true call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 9#rec_strcopy_helperENTRYtrue [2022-02-21 03:36:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:14,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1155759793, now seen corresponding path program 1 times [2022-02-21 03:36:14,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:14,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162416710] [2022-02-21 03:36:14,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:14,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:14,307 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:14,386 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:14,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:14,389 INFO L85 PathProgramCache]: Analyzing trace with hash 29912, now seen corresponding path program 1 times [2022-02-21 03:36:14,390 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:14,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237064744] [2022-02-21 03:36:14,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:14,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:14,429 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:14,454 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:14,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1512818648, now seen corresponding path program 1 times [2022-02-21 03:36:14,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:14,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567875746] [2022-02-21 03:36:14,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:14,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:14,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {24#true} is VALID [2022-02-21 03:36:14,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1.base, main_#t~ret6#1.offset, main_#t~ret7#1.base, main_#t~ret7#1.offset, main_~length~0#1, main_~original~0#1.base, main_~original~0#1.offset, main_~res~0#1.base, main_~res~0#1.offset;main_~length~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {24#true} is VALID [2022-02-21 03:36:14,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume main_~length~0#1 < 1;main_~length~0#1 := 1; {26#(<= |ULTIMATE.start_main_~length~0#1| 1)} is VALID [2022-02-21 03:36:14,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#(<= |ULTIMATE.start_main_~length~0#1| 1)} assume { :begin_inline_build_nondet_String } true;build_nondet_String_#in~length#1 := main_~length~0#1;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length#1 := build_nondet_String_#in~length#1;call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {27#(and (= (select |#valid| |ULTIMATE.start_build_nondet_String_#res#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res#1.base|) |ULTIMATE.start_build_nondet_String_#res#1.offset|) 0))} is VALID [2022-02-21 03:36:14,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#(and (= (select |#valid| |ULTIMATE.start_build_nondet_String_#res#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_build_nondet_String_#res#1.base|) |ULTIMATE.start_build_nondet_String_#res#1.offset|) 0))} main_#t~ret6#1.base, main_#t~ret6#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~original~0#1.base, main_~original~0#1.offset := main_#t~ret6#1.base, main_#t~ret6#1.offset;havoc main_#t~ret6#1.base, main_#t~ret6#1.offset;assume { :begin_inline_rec_strcopy } true;rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset, rec_strcopy_#in~length#1 := main_~original~0#1.base, main_~original~0#1.offset, main_~length~0#1;havoc rec_strcopy_#res#1.base, rec_strcopy_#res#1.offset;havoc rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset, rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~length#1, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset;rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset := rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset;rec_strcopy_~length#1 := rec_strcopy_#in~length#1;call rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset := #Ultimate.allocOnHeap(rec_strcopy_~length#1);rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset := rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset;havoc rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset; {28#(and (not (= |ULTIMATE.start_rec_strcopy_~copyAlloc~0#1.base| |ULTIMATE.start_rec_strcopy_~source#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_rec_strcopy_~source#1.base|) |ULTIMATE.start_rec_strcopy_~source#1.offset|) 0))} is VALID [2022-02-21 03:36:14,757 INFO L272 TraceCheckUtils]: 5: Hoare triple {28#(and (not (= |ULTIMATE.start_rec_strcopy_~copyAlloc~0#1.base| |ULTIMATE.start_rec_strcopy_~source#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_rec_strcopy_~source#1.base|) |ULTIMATE.start_rec_strcopy_~source#1.offset|) 0))} call rec_strcopy_helper(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset); {29#(and (not (= |rec_strcopy_helper_#in~source.base| |rec_strcopy_helper_#in~dest.base|)) (= (select (select |#memory_int| |rec_strcopy_helper_#in~source.base|) |rec_strcopy_helper_#in~source.offset|) 0))} is VALID [2022-02-21 03:36:14,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(and (not (= |rec_strcopy_helper_#in~source.base| |rec_strcopy_helper_#in~dest.base|)) (= (select (select |#memory_int| |rec_strcopy_helper_#in~source.base|) |rec_strcopy_helper_#in~source.offset|) 0))} ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem2 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem2, ~dest.base, ~dest.offset, 1);havoc #t~mem2;call #t~mem3 := read~int(~source.base, ~source.offset, 1); {30#(and (not (= rec_strcopy_helper_~dest.base rec_strcopy_helper_~source.base)) (= |rec_strcopy_helper_#t~mem3| 0))} is VALID [2022-02-21 03:36:14,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(and (not (= rec_strcopy_helper_~dest.base rec_strcopy_helper_~source.base)) (= |rec_strcopy_helper_#t~mem3| 0))} assume 0 != #t~mem3;havoc #t~mem3; {25#false} is VALID [2022-02-21 03:36:14,759 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset); {25#false} is VALID [2022-02-21 03:36:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:14,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:14,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567875746] [2022-02-21 03:36:14,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567875746] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:14,763 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:14,764 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:36:14,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657271588] [2022-02-21 03:36:14,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:15,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:15,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:36:15,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:36:15,418 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:15,690 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-21 03:36:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:36:15,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:15,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:15,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2022-02-21 03:36:15,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:15,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 9 transitions. [2022-02-21 03:36:15,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:36:15,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:36:15,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 9 transitions. [2022-02-21 03:36:15,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:15,728 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-21 03:36:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 9 transitions. [2022-02-21 03:36:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-21 03:36:15,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:15,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 9 transitions. Second operand has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:15,753 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 9 transitions. Second operand has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:15,755 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:15,757 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-21 03:36:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-21 03:36:15,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:15,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:15,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 9 transitions. [2022-02-21 03:36:15,762 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 9 transitions. [2022-02-21 03:36:15,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:15,765 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-21 03:36:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-21 03:36:15,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:15,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:15,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:15,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-02-21 03:36:15,778 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-21 03:36:15,778 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-21 03:36:15,779 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:36:15,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 9 transitions. [2022-02-21 03:36:15,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:15,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:15,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:15,782 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:36:15,782 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:15,782 INFO L791 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 68#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1.base, main_#t~ret6#1.offset, main_#t~ret7#1.base, main_#t~ret7#1.offset, main_~length~0#1, main_~original~0#1.base, main_~original~0#1.offset, main_~res~0#1.base, main_~res~0#1.offset;main_~length~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 75#L35 assume !(main_~length~0#1 < 1); 73#L35-2 assume { :begin_inline_build_nondet_String } true;build_nondet_String_#in~length#1 := main_~length~0#1;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length#1 := build_nondet_String_#in~length#1;call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 74#L12 main_#t~ret6#1.base, main_#t~ret6#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~original~0#1.base, main_~original~0#1.offset := main_#t~ret6#1.base, main_#t~ret6#1.offset;havoc main_#t~ret6#1.base, main_#t~ret6#1.offset;assume { :begin_inline_rec_strcopy } true;rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset, rec_strcopy_#in~length#1 := main_~original~0#1.base, main_~original~0#1.offset, main_~length~0#1;havoc rec_strcopy_#res#1.base, rec_strcopy_#res#1.offset;havoc rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset, rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~length#1, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset;rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset := rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset;rec_strcopy_~length#1 := rec_strcopy_#in~length#1;call rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset := #Ultimate.allocOnHeap(rec_strcopy_~length#1);rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset := rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset;havoc rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset; 69#L28 call rec_strcopy_helper(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset);< 70#rec_strcopy_helperENTRY [2022-02-21 03:36:15,782 INFO L793 eck$LassoCheckResult]: Loop: 70#rec_strcopy_helperENTRY ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem2 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem2, ~dest.base, ~dest.offset, 1);havoc #t~mem2;call #t~mem3 := read~int(~source.base, ~source.offset, 1); 71#L21 assume 0 != #t~mem3;havoc #t~mem3; 72#L22 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 70#rec_strcopy_helperENTRY [2022-02-21 03:36:15,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:15,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1155819375, now seen corresponding path program 1 times [2022-02-21 03:36:15,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:15,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697096382] [2022-02-21 03:36:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:15,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:15,828 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:15,843 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:15,844 INFO L85 PathProgramCache]: Analyzing trace with hash 29912, now seen corresponding path program 2 times [2022-02-21 03:36:15,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:15,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592431000] [2022-02-21 03:36:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:15,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:15,854 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:15,862 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:15,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:15,863 INFO L85 PathProgramCache]: Analyzing trace with hash 262188714, now seen corresponding path program 1 times [2022-02-21 03:36:15,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:15,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221461311] [2022-02-21 03:36:15,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:15,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:15,887 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:15,908 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:17,369 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:17,370 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:17,371 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:17,371 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:17,371 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:17,371 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:17,371 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:17,371 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:17,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc.i_Iteration2_Lasso [2022-02-21 03:36:17,372 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:17,372 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:17,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,649 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:36:17,651 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:36:17,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:17,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:18,317 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:18,321 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:18,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:18,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:18,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:18,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:18,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:18,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:18,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:18,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:18,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:18,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:18,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:18,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:36:18,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:18,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:18,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:18,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:18,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:18,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:18,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:18,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:18,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:18,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:18,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:18,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:18,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:18,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:36:18,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:18,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:18,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:18,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:18,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:18,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:18,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:36:18,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:18,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:18,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:18,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:18,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:18,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:18,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:18,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:18,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:18,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:18,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:18,549 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:18,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:36:18,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:18,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:18,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:18,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:18,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:18,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:18,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:18,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:18,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:18,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:18,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:18,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:18,605 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:18,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:18,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:18,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:18,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:18,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:18,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:18,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:18,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:18,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:36:18,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:18,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:18,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:18,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:18,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:18,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:36:18,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:18,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:18,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:18,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:18,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:18,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:18,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:18,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:18,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:18,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:18,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:18,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:18,725 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:18,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:36:18,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:18,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:18,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:18,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:18,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:18,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:18,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:18,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:18,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:18,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:18,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:18,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:18,786 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:18,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:36:18,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:18,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:18,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:18,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:18,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:18,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:18,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:18,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:18,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:18,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:18,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:18,864 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:18,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:18,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:18,884 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:36:18,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:18,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:18,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:36:18,894 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 03:36:18,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:18,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:18,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:18,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:18,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:18,934 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:18,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:36:18,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:18,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:18,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:18,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:18,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:18,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:18,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:18,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:18,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:18,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:18,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:18,975 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:18,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:36:18,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:18,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:18,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:18,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:18,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:19,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:19,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:19,019 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:19,074 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 03:36:19,075 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:36:19,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:19,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:19,107 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:19,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:36:19,148 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:19,172 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:19,173 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:19,173 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length rec_strcopy_helper_#in~dest.base)_1, rec_strcopy_helper_#in~dest.offset) = 1*v_rep(select #length rec_strcopy_helper_#in~dest.base)_1 - 1*rec_strcopy_helper_#in~dest.offset Supporting invariants [] [2022-02-21 03:36:19,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:19,227 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 03:36:19,233 INFO L390 LassoCheck]: Loop: "~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem2 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem2, ~dest.base, ~dest.offset, 1);havoc #t~mem2;call #t~mem3 := read~int(~source.base, ~source.offset, 1);" "assume 0 != #t~mem3;havoc #t~mem3;" "call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);"< [2022-02-21 03:36:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:19,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:36:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:19,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:19,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {103#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {103#unseeded} is VALID [2022-02-21 03:36:19,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {103#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1.base, main_#t~ret6#1.offset, main_#t~ret7#1.base, main_#t~ret7#1.offset, main_~length~0#1, main_~original~0#1.base, main_~original~0#1.offset, main_~res~0#1.base, main_~res~0#1.offset;main_~length~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {103#unseeded} is VALID [2022-02-21 03:36:19,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {103#unseeded} assume !(main_~length~0#1 < 1); {103#unseeded} is VALID [2022-02-21 03:36:19,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {103#unseeded} assume { :begin_inline_build_nondet_String } true;build_nondet_String_#in~length#1 := main_~length~0#1;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length#1 := build_nondet_String_#in~length#1;call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; {103#unseeded} is VALID [2022-02-21 03:36:19,311 INFO L290 TraceCheckUtils]: 4: Hoare triple {103#unseeded} main_#t~ret6#1.base, main_#t~ret6#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;main_~original~0#1.base, main_~original~0#1.offset := main_#t~ret6#1.base, main_#t~ret6#1.offset;havoc main_#t~ret6#1.base, main_#t~ret6#1.offset;assume { :begin_inline_rec_strcopy } true;rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset, rec_strcopy_#in~length#1 := main_~original~0#1.base, main_~original~0#1.offset, main_~length~0#1;havoc rec_strcopy_#res#1.base, rec_strcopy_#res#1.offset;havoc rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset, rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~length#1, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset;rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset := rec_strcopy_#in~source#1.base, rec_strcopy_#in~source#1.offset;rec_strcopy_~length#1 := rec_strcopy_#in~length#1;call rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset := #Ultimate.allocOnHeap(rec_strcopy_~length#1);rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset := rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset;havoc rec_strcopy_#t~malloc4#1.base, rec_strcopy_#t~malloc4#1.offset; {103#unseeded} is VALID [2022-02-21 03:36:19,312 INFO L272 TraceCheckUtils]: 5: Hoare triple {103#unseeded} call rec_strcopy_helper(rec_strcopy_~source#1.base, rec_strcopy_~source#1.offset, rec_strcopy_~copyAlloc~0#1.base, rec_strcopy_~copyAlloc~0#1.offset); {103#unseeded} is VALID [2022-02-21 03:36:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:19,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:36:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:19,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:19,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {106#(>= oldRank0 (+ (select |#length| |rec_strcopy_helper_#in~dest.base|) (* (- 1) |rec_strcopy_helper_#in~dest.offset|)))} ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem2 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem2, ~dest.base, ~dest.offset, 1);havoc #t~mem2;call #t~mem3 := read~int(~source.base, ~source.offset, 1); {156#(and (<= (select |#length| rec_strcopy_helper_~dest.base) (+ oldRank0 rec_strcopy_helper_~dest.offset)) (<= (+ rec_strcopy_helper_~dest.offset 1) (select |#length| rec_strcopy_helper_~dest.base)))} is VALID [2022-02-21 03:36:19,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#(and (<= (select |#length| rec_strcopy_helper_~dest.base) (+ oldRank0 rec_strcopy_helper_~dest.offset)) (<= (+ rec_strcopy_helper_~dest.offset 1) (select |#length| rec_strcopy_helper_~dest.base)))} assume 0 != #t~mem3;havoc #t~mem3; {156#(and (<= (select |#length| rec_strcopy_helper_~dest.base) (+ oldRank0 rec_strcopy_helper_~dest.offset)) (<= (+ rec_strcopy_helper_~dest.offset 1) (select |#length| rec_strcopy_helper_~dest.base)))} is VALID [2022-02-21 03:36:19,390 INFO L272 TraceCheckUtils]: 2: Hoare triple {156#(and (<= (select |#length| rec_strcopy_helper_~dest.base) (+ oldRank0 rec_strcopy_helper_~dest.offset)) (<= (+ rec_strcopy_helper_~dest.offset 1) (select |#length| rec_strcopy_helper_~dest.base)))} call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset); {136#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |rec_strcopy_helper_#in~dest.base|) (* (- 1) |rec_strcopy_helper_#in~dest.offset|)))))} is VALID [2022-02-21 03:36:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:19,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:19,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:19,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:19,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,407 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 [2022-02-21 03:36:19,408 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 9 transitions. cyclomatic complexity: 1 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:19,461 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 9 transitions. cyclomatic complexity: 1. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 16 transitions. Complement of second has 7 states. [2022-02-21 03:36:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:19,461 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:19,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 9 transitions. cyclomatic complexity: 1 [2022-02-21 03:36:19,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:19,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:19,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:19,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:19,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:19,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:19,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 16 transitions. [2022-02-21 03:36:19,468 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:19,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:19,470 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 9 transitions. cyclomatic complexity: 1 [2022-02-21 03:36:19,472 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:19,472 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:19,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:19,478 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:19,478 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 16 transitions. cyclomatic complexity: 1 [2022-02-21 03:36:19,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 16 transitions. cyclomatic complexity: 1 [2022-02-21 03:36:19,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:19,479 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:19,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:19,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:19,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 16 transitions. cyclomatic complexity: 1 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:19,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:19,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:19,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 16 transitions. cyclomatic complexity: 1 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:19,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:36:19,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:36:19,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 16 transitions. cyclomatic complexity: 1 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:36:19,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:36:19,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:36:19,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 16 transitions. cyclomatic complexity: 1 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:36:19,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:19,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:19,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 16 transitions. cyclomatic complexity: 1 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:19,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:19,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:19,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 16 transitions. cyclomatic complexity: 1 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:19,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:19,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:19,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 16 transitions. cyclomatic complexity: 1 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 16 transitions. cyclomatic complexity: 1 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 16 transitions. cyclomatic complexity: 1 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,493 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:36:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:19,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:19,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 16 transitions. cyclomatic complexity: 1 [2022-02-21 03:36:19,498 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:19,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2022-02-21 03:36:19,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:36:19,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:36:19,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:36:19,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:19,499 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:19,499 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:19,499 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:19,500 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:36:19,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:36:19,500 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:19,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:19,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:36:19 BoogieIcfgContainer [2022-02-21 03:36:19,511 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:36:19,512 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:36:19,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:36:19,512 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:36:19,513 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:14" (3/4) ... [2022-02-21 03:36:19,515 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:36:19,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:36:19,517 INFO L158 Benchmark]: Toolchain (without parser) took 6148.56ms. Allocated memory was 107.0MB in the beginning and 174.1MB in the end (delta: 67.1MB). Free memory was 77.6MB in the beginning and 107.3MB in the end (delta: -29.6MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2022-02-21 03:36:19,517 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 107.0MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:19,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.75ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 77.6MB in the beginning and 119.6MB in the end (delta: -42.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:36:19,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.16ms. Allocated memory is still 144.7MB. Free memory was 119.6MB in the beginning and 118.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:19,521 INFO L158 Benchmark]: Boogie Preprocessor took 38.46ms. Allocated memory is still 144.7MB. Free memory was 118.0MB in the beginning and 116.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:19,523 INFO L158 Benchmark]: RCFGBuilder took 391.93ms. Allocated memory is still 144.7MB. Free memory was 116.5MB in the beginning and 104.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:36:19,524 INFO L158 Benchmark]: BuchiAutomizer took 5452.81ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 104.4MB in the beginning and 108.3MB in the end (delta: -3.9MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2022-02-21 03:36:19,524 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 174.1MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:19,530 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 107.0MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.75ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 77.6MB in the beginning and 119.6MB in the end (delta: -42.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.16ms. Allocated memory is still 144.7MB. Free memory was 119.6MB in the beginning and 118.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.46ms. Allocated memory is still 144.7MB. Free memory was 118.0MB in the beginning and 116.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 391.93ms. Allocated memory is still 144.7MB. Free memory was 116.5MB in the beginning and 104.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5452.81ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 104.4MB in the beginning and 108.3MB in the end (delta: -3.9MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 174.1MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[dest] + -1 * dest and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 31 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital158 mio100 ax100 hnf100 lsp96 ukn71 mio100 lsp45 div100 bol100 ite100 ukn100 eq181 hnf89 smp100 dnf107 smp93 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:36:19,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:19,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE