./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncmp_mixed_alloca.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-15/cstrncmp_mixed_alloca.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 8073940322b86f31cbfc905281bb42e15edc78a9ca8cdc6bd61dc1df37f3cf2e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:15,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:15,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:15,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:15,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:15,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:15,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:15,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:15,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:15,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:15,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:15,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:15,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:15,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:15,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:15,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:15,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:15,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:15,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:15,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:15,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:15,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:15,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:15,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:15,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:15,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:15,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:15,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:15,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:15,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:15,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:15,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:15,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:15,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:15,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:15,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:15,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:15,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:15,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:15,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:15,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:15,265 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:35:15,294 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:15,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:15,294 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:15,294 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:15,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:15,296 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:15,296 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:15,296 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:15,296 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:15,296 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:15,297 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:15,297 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:15,297 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:15,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:15,298 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:15,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:15,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:15,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:15,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:15,299 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:15,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:15,299 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:15,299 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:15,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:15,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:15,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:15,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:15,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:15,301 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:15,301 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 -> 8073940322b86f31cbfc905281bb42e15edc78a9ca8cdc6bd61dc1df37f3cf2e [2022-02-21 03:35:15,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:15,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:15,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:15,481 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:15,482 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:15,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncmp_mixed_alloca.i [2022-02-21 03:35:15,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278d594f8/3427f91e4505446cb847a2de24f82d46/FLAG453a48dfe [2022-02-21 03:35:15,947 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:15,947 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncmp_mixed_alloca.i [2022-02-21 03:35:15,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278d594f8/3427f91e4505446cb847a2de24f82d46/FLAG453a48dfe [2022-02-21 03:35:16,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278d594f8/3427f91e4505446cb847a2de24f82d46 [2022-02-21 03:35:16,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:16,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:16,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:16,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:16,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:16,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:16" (1/1) ... [2022-02-21 03:35:16,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39aeaa70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:16, skipping insertion in model container [2022-02-21 03:35:16,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:16" (1/1) ... [2022-02-21 03:35:16,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:16,401 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:16,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:16,645 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:16,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:16,705 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:16,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:16 WrapperNode [2022-02-21 03:35:16,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:16,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:16,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:16,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:16,712 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:35:16" (1/1) ... [2022-02-21 03:35:16,723 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:35:16" (1/1) ... [2022-02-21 03:35:16,742 INFO L137 Inliner]: procedures = 153, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 109 [2022-02-21 03:35:16,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:16,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:16,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:16,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:16,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:16" (1/1) ... [2022-02-21 03:35:16,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:16" (1/1) ... [2022-02-21 03:35:16,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:16" (1/1) ... [2022-02-21 03:35:16,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:16" (1/1) ... [2022-02-21 03:35:16,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:16" (1/1) ... [2022-02-21 03:35:16,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:16" (1/1) ... [2022-02-21 03:35:16,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:16" (1/1) ... [2022-02-21 03:35:16,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:16,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:16,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:16,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:16,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:16" (1/1) ... [2022-02-21 03:35:16,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:16,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:16,804 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:35:16,820 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:35:16,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:16,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:16,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:35:16,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:16,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:16,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:16,889 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:16,890 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:17,163 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:17,167 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:17,167 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:35:17,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:17 BoogieIcfgContainer [2022-02-21 03:35:17,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:17,169 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:17,169 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:17,172 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:17,172 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:17,172 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:16" (1/3) ... [2022-02-21 03:35:17,173 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15199342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:17, skipping insertion in model container [2022-02-21 03:35:17,174 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:17,174 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:16" (2/3) ... [2022-02-21 03:35:17,174 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15199342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:17, skipping insertion in model container [2022-02-21 03:35:17,174 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:17,174 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:17" (3/3) ... [2022-02-21 03:35:17,175 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrncmp_mixed_alloca.i [2022-02-21 03:35:17,203 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:17,203 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:17,203 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:17,203 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:17,203 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:17,204 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:17,204 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:17,204 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:17,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:17,228 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:17,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:17,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:17,231 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:17,232 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:17,232 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:17,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:17,236 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:17,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:17,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:17,237 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:17,237 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:17,243 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 4#L383true assume !(main_~length1~0#1 < 1); 12#L383-2true assume !(main_~length2~0#1 < 1); 13#L386-1true call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 25#L391-3true [2022-02-21 03:35:17,244 INFO L793 eck$LassoCheckResult]: Loop: 25#L391-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; 6#L391-2true main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; 25#L391-3true [2022-02-21 03:35:17,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:17,248 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 03:35:17,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:17,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486002505] [2022-02-21 03:35:17,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:17,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:17,367 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:17,449 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-02-21 03:35:17,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:17,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942430324] [2022-02-21 03:35:17,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:17,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:17,478 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:17,491 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:17,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-02-21 03:35:17,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:17,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385643608] [2022-02-21 03:35:17,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:17,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:17,531 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:17,565 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:17,877 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:17,878 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:17,878 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:17,878 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:17,878 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:17,878 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:17,878 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:17,879 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:17,879 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_mixed_alloca.i_Iteration1_Lasso [2022-02-21 03:35:17,879 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:17,879 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:17,892 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:35:17,897 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:35:18,080 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:35:18,082 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:35:18,085 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:35:18,090 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:35:18,092 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:35:18,094 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:35:18,096 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:35:18,098 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:35:18,102 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:35:18,104 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:35:18,106 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:35:18,358 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:18,361 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:18,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:18,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:18,363 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:35: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:35:18,366 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:35:18,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:18,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:18,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:18,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:18,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:18,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:18,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:18,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:18,427 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:35:18,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:18,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:18,428 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:35:18,429 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:35:18,431 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:35:18,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:18,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:18,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:18,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:18,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:18,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:18,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:18,475 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:35:18,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:18,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:18,483 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:35:18,484 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:35:18,486 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:35:18,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:18,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:18,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:18,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:18,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:18,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:18,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:18,521 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:35:18,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:18,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:18,523 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:35:18,524 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:35:18,525 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:35:18,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:18,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:18,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:18,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:18,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:18,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:18,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:18,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:18,551 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:35:18,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:18,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:18,553 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:35:18,554 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:35:18,556 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:35:18,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:18,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:18,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:18,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:18,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:18,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:18,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:18,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:18,593 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:35:18,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:18,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:18,595 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:35:18,596 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:35:18,598 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:35:18,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:18,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:18,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:18,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:18,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:18,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:18,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:18,649 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:35:18,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:18,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:18,664 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:35:18,665 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:35:18,692 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:35:18,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:18,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:18,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:18,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:18,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:18,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:18,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:18,732 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:35:18,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:18,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:18,734 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:35:18,735 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:35:18,736 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:35:18,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:18,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:18,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:18,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:18,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:18,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:18,764 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:18,785 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-02-21 03:35:18,785 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-02-21 03:35:18,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:18,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:18,817 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:35:18,848 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:35:18,849 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:18,869 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:18,869 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:18,870 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length1~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:35:18,917 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:35:18,940 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 03:35:18,945 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1;" "main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1;" [2022-02-21 03:35:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:18,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:18,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:19,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:19,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {34#unseeded} is VALID [2022-02-21 03:35:19,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; {34#unseeded} is VALID [2022-02-21 03:35:19,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#unseeded} assume !(main_~length1~0#1 < 1); {34#unseeded} is VALID [2022-02-21 03:35:19,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#unseeded} assume !(main_~length2~0#1 < 1); {34#unseeded} is VALID [2022-02-21 03:35:19,018 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#unseeded} call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; {34#unseeded} is VALID [2022-02-21 03:35:19,027 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:35:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:19,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:35:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:19,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:19,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#(>= oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; {94#(and (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length1~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|))))} is VALID [2022-02-21 03:35:19,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {94#(and (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length1~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|))))} main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; {77#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~length1~0#1| (* (- 1) |ULTIMATE.start_main_~i~0#1|)))) unseeded)} is VALID [2022-02-21 03:35:19,066 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:35:19,103 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), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:19,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:19,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,122 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:35:19,123 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,247 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 91 transitions. Complement of second has 7 states. [2022-02-21 03:35:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:19,247 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:19,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,250 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:19,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:19,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:19,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:35:19,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:19,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:19,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 91 transitions. [2022-02-21 03:35:19,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:19,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:19,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:19,257 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,259 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:19,260 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:35:19,260 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:35:19,263 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:19,263 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 91 transitions. cyclomatic complexity: 38 [2022-02-21 03:35:19,264 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:35:19,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:19,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:19,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:19,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 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:35:19,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 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:35:19,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:19,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:19,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:19,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:19,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 60 letters. [2022-02-21 03:35:19,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 60 letters. [2022-02-21 03:35:19,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 60 letters. Loop has 60 letters. [2022-02-21 03:35:19,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:35:19,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:35:19,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:35:19,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:35:19,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:35:19,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:35:19,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:19,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:19,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:19,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:35:19,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:35:19,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:35:19,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:35:19,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:35:19,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:35:19,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:19,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:19,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:19,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:35:19,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:35:19,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:35:19,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:19,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:19,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:19,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:19,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:19,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:19,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:19,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:19,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:19,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:35:19,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:35:19,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:35:19,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:35:19,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:35:19,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:35:19,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 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:35:19,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 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:35:19,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:19,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:19,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:19,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:19,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:35:19,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:35:19,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:35:19,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:19,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:19,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:19,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:35:19,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:35:19,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:35:19,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:35:19,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:35:19,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:35:19,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:19,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:19,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:19,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:19,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:19,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 91 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:19,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,289 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-21 03:35:19,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:19,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:19,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:35:19,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:19,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 91 transitions. cyclomatic complexity: 38 [2022-02-21 03:35:19,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:19,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 18 states and 25 transitions. [2022-02-21 03:35:19,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 03:35:19,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 03:35:19,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-02-21 03:35:19,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:19,304 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-02-21 03:35:19,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 03:35:19,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:19,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,320 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,322 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:19,324 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:35:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:19,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:19,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:19,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 25 transitions. [2022-02-21 03:35:19,325 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 25 transitions. [2022-02-21 03:35:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:19,326 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:35:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:19,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:19,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:19,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:19,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 03:35:19,329 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:19,329 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:19,329 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:19,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:19,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:19,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:19,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:19,330 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:19,330 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:19,330 INFO L791 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 171#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 168#L383 assume !(main_~length1~0#1 < 1); 169#L383-2 assume !(main_~length2~0#1 < 1); 181#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 182#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 184#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 174#L396-3 [2022-02-21 03:35:19,330 INFO L793 eck$LassoCheckResult]: Loop: 174#L396-3 assume !!(main_~i~1#1 > 0);call write~int(main_#t~nondet223#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet223#1; 176#L396-2 main_#t~post222#1 := main_~i~1#1;main_~i~1#1 := main_#t~post222#1 - 1;havoc main_#t~post222#1; 174#L396-3 [2022-02-21 03:35:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:19,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-02-21 03:35:19,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:19,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947951072] [2022-02-21 03:35:19,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:19,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:19,346 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:19,355 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:19,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:19,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-02-21 03:35:19,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:19,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828313168] [2022-02-21 03:35:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:19,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:19,362 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:19,365 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:19,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:19,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-02-21 03:35:19,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:19,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603639579] [2022-02-21 03:35:19,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:19,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:19,391 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:19,697 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:19,698 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:19,698 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:19,698 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:19,698 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:19,698 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:19,698 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:19,698 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:19,698 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_mixed_alloca.i_Iteration2_Lasso [2022-02-21 03:35:19,699 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:19,699 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:19,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:35:19,706 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:35:19,708 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:35:19,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:35:19,712 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:35:19,714 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:35:19,716 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:35:19,718 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:35:19,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:35:19,896 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:35:19,899 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:35:19,902 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:35:20,170 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:20,171 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:20,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:20,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,172 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:35:20,192 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:35:20,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:20,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:20,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:20,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:20,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:20,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:20,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:20,203 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:35:20,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:20,232 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:35:20,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:20,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,234 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:35:20,235 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:35:20,236 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:35:20,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:20,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:20,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:20,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:20,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:20,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:20,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:20,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:20,277 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:35:20,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:20,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,279 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:35:20,280 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:35:20,281 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:35:20,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:20,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:20,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:20,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:20,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:20,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:20,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:20,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:20,321 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:35:20,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:20,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,323 INFO L229 MonitoredProcess]: Starting monitored process 14 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:35:20,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:35:20,326 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:35:20,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:20,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:20,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:20,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:20,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:20,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:20,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:20,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:20,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:20,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:20,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,383 INFO L229 MonitoredProcess]: Starting monitored process 15 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:35:20,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:35:20,386 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:35:20,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:20,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:20,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:20,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:20,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:20,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:20,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:20,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:20,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:20,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:20,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,427 INFO L229 MonitoredProcess]: Starting monitored process 16 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:35:20,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:35:20,430 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:35:20,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:20,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:20,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:20,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:20,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:20,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:20,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:20,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:20,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:20,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:20,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,471 INFO L229 MonitoredProcess]: Starting monitored process 17 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:35:20,482 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:35:20,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:20,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:20,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:20,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:20,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:20,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:20,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:35:20,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:20,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:20,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:20,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,520 INFO L229 MonitoredProcess]: Starting monitored process 18 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:35:20,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:35:20,524 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:35:20,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:20,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:20,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:20,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:20,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:20,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:20,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:20,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:20,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:20,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:20,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,578 INFO L229 MonitoredProcess]: Starting monitored process 19 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:35:20,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:35:20,582 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:35:20,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:20,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:20,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:20,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:20,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:20,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:20,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:20,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 03:35:20,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:20,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,630 INFO L229 MonitoredProcess]: Starting monitored process 20 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:35:20,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:35:20,636 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:35:20,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:20,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:20,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:20,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:20,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:20,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:20,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:20,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:20,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:20,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,668 INFO L229 MonitoredProcess]: Starting monitored process 21 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:35:20,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:35:20,673 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:35:20,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:20,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:20,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:20,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:20,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:20,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:20,701 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:20,710 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-02-21 03:35:20,710 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-02-21 03:35:20,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:20,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,715 INFO L229 MonitoredProcess]: Starting monitored process 22 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:35:20,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:35:20,744 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:20,765 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:20,765 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:20,765 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2022-02-21 03:35:20,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:20,824 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2022-02-21 03:35:20,826 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 > 0);call write~int(main_#t~nondet223#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet223#1;" "main_#t~post222#1 := main_~i~1#1;main_~i~1#1 := main_#t~post222#1 - 1;havoc main_#t~post222#1;" [2022-02-21 03:35:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:20,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:20,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:20,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:20,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {231#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {231#unseeded} is VALID [2022-02-21 03:35:20,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; {231#unseeded} is VALID [2022-02-21 03:35:20,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#unseeded} assume !(main_~length1~0#1 < 1); {231#unseeded} is VALID [2022-02-21 03:35:20,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {231#unseeded} assume !(main_~length2~0#1 < 1); {231#unseeded} is VALID [2022-02-21 03:35:20,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {231#unseeded} call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; {231#unseeded} is VALID [2022-02-21 03:35:20,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {231#unseeded} is VALID [2022-02-21 03:35:20,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#unseeded} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; {231#unseeded} is VALID [2022-02-21 03:35:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:20,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:35:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:20,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:20,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(>= oldRank0 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 > 0);call write~int(main_#t~nondet223#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet223#1; {312#(and (>= oldRank0 |ULTIMATE.start_main_~i~1#1|) (< 0 |ULTIMATE.start_main_~i~1#1|))} is VALID [2022-02-21 03:35:20,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#(and (>= oldRank0 |ULTIMATE.start_main_~i~1#1|) (< 0 |ULTIMATE.start_main_~i~1#1|))} main_#t~post222#1 := main_~i~1#1;main_~i~1#1 := main_#t~post222#1 - 1;havoc main_#t~post222#1; {289#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~1#1|)))} is VALID [2022-02-21 03:35:20,909 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:35:20,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,915 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:35:20,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:20,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,916 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:35:20,916 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,959 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 40 transitions. Complement of second has 6 states. [2022-02-21 03:35:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:20,959 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:20,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 10 [2022-02-21 03:35:20,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:20,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:20,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:20,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:20,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:20,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2022-02-21 03:35:20,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:20,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:20,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:20,966 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 10 [2022-02-21 03:35:20,970 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:35:20,970 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:20,972 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:20,972 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 40 transitions. cyclomatic complexity: 17 [2022-02-21 03:35:20,972 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:35:20,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:20,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:20,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:20,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:20,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 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:35:20,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:20,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:20,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:20,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:20,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:35:20,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:35:20,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:35:20,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:20,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:20,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:20,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:20,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:20,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:20,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:35:20,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:35:20,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:35:20,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:35:20,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:35:20,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:35:20,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:20,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:20,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:20,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:35:20,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:35:20,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:35:20,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:20,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:20,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:20,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:20,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:20,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:20,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:20,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:20,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:20,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:20,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 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:35:20,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:20,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:20,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:20,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:35:20,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:35:20,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:35:20,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:35:20,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:35:20,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:35:20,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:35:20,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:35:20,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:35:20,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:35:20,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:20,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:20,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:20,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,985 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-02-21 03:35:20,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:20,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:35:20,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:35:20,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:20,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 40 transitions. cyclomatic complexity: 17 [2022-02-21 03:35:20,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:20,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 19 states and 27 transitions. [2022-02-21 03:35:20,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:35:20,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 03:35:20,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2022-02-21 03:35:20,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:20,993 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-02-21 03:35:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2022-02-21 03:35:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-21 03:35:20,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:20,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,994 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,994 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:20,995 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2022-02-21 03:35:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2022-02-21 03:35:20,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:20,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:20,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 27 transitions. [2022-02-21 03:35:20,996 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 27 transitions. [2022-02-21 03:35:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:20,997 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2022-02-21 03:35:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2022-02-21 03:35:20,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:20,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:20,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:20,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2022-02-21 03:35:20,999 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-02-21 03:35:20,999 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-02-21 03:35:20,999 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:20,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2022-02-21 03:35:21,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:21,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:21,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:21,001 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:21,001 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:21,001 INFO L791 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 357#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 352#L383 assume !(main_~length1~0#1 < 1); 353#L383-2 assume !(main_~length2~0#1 < 1); 366#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 367#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 369#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 358#L396-3 assume !(main_~i~1#1 > 0); 359#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 364#L368 assume !(0 == cstrncmp_~n#1); 365#L370-5 [2022-02-21 03:35:21,002 INFO L793 eck$LassoCheckResult]: Loop: 365#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 368#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 362#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 363#L371 assume cstrncmp_#t~short210#1; 370#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 365#L370-5 [2022-02-21 03:35:21,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1595220890, now seen corresponding path program 1 times [2022-02-21 03:35:21,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438245421] [2022-02-21 03:35:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,032 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,050 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:21,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,050 INFO L85 PathProgramCache]: Analyzing trace with hash 79307716, now seen corresponding path program 1 times [2022-02-21 03:35:21,050 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,050 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602686170] [2022-02-21 03:35:21,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:21,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#true} cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; {414#true} is VALID [2022-02-21 03:35:21,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; {414#true} is VALID [2022-02-21 03:35:21,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; {414#true} is VALID [2022-02-21 03:35:21,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {414#true} assume cstrncmp_#t~short210#1; {416#|ULTIMATE.start_cstrncmp_#t~short210#1|} is VALID [2022-02-21 03:35:21,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {416#|ULTIMATE.start_cstrncmp_#t~short210#1|} assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; {415#false} is VALID [2022-02-21 03:35:21,081 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:35:21,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:21,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602686170] [2022-02-21 03:35:21,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602686170] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:21,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:21,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:35:21,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067103863] [2022-02-21 03:35:21,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:21,084 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:21,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:21,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:35:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:35:21,087 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 11 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:21,106 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 03:35:21,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:35:21,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:21,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2022-02-21 03:35:21,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:21,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 26 transitions. [2022-02-21 03:35:21,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 03:35:21,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 03:35:21,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-02-21 03:35:21,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:21,112 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:35:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-02-21 03:35:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-21 03:35:21,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:21,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,113 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,113 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:21,114 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 03:35:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2022-02-21 03:35:21,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:21,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:21,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 26 transitions. [2022-02-21 03:35:21,114 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 26 transitions. [2022-02-21 03:35:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:21,115 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 03:35:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2022-02-21 03:35:21,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:21,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:21,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:21,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-02-21 03:35:21,115 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:35:21,115 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:35:21,115 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:35:21,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-02-21 03:35:21,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:21,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:21,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:21,116 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:21,116 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:21,116 INFO L791 eck$LassoCheckResult]: Stem: 439#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 440#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 437#L383 assume !(main_~length1~0#1 < 1); 438#L383-2 assume !(main_~length2~0#1 < 1); 449#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 450#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 454#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 443#L396-3 assume !(main_~i~1#1 > 0); 444#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 451#L368 assume !(0 == cstrncmp_~n#1); 452#L370-5 [2022-02-21 03:35:21,116 INFO L793 eck$LassoCheckResult]: Loop: 452#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 453#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 447#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 448#L371 assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; 455#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 452#L370-5 [2022-02-21 03:35:21,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1595220890, now seen corresponding path program 2 times [2022-02-21 03:35:21,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867555393] [2022-02-21 03:35:21,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,130 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:21,139 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 1 times [2022-02-21 03:35:21,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519867691] [2022-02-21 03:35:21,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,145 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,149 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:21,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1988601847, now seen corresponding path program 1 times [2022-02-21 03:35:21,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655376358] [2022-02-21 03:35:21,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:21,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {501#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {501#true} is VALID [2022-02-21 03:35:21,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; {501#true} is VALID [2022-02-21 03:35:21,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {501#true} assume !(main_~length1~0#1 < 1); {503#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 03:35:21,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {503#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 1); {503#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 03:35:21,265 INFO L290 TraceCheckUtils]: 4: Hoare triple {503#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; {504#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} is VALID [2022-02-21 03:35:21,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {504#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {505#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} is VALID [2022-02-21 03:35:21,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {505#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; {506#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~nondetString1~0#1.base|) |ULTIMATE.start_main_~nondetString1~0#1.offset|) 0))} is VALID [2022-02-21 03:35:21,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {506#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~nondetString1~0#1.base|) |ULTIMATE.start_main_~nondetString1~0#1.offset|) 0))} assume !(main_~i~1#1 > 0); {506#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~nondetString1~0#1.base|) |ULTIMATE.start_main_~nondetString1~0#1.offset|) 0))} is VALID [2022-02-21 03:35:21,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {506#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~nondetString1~0#1.base|) |ULTIMATE.start_main_~nondetString1~0#1.offset|) 0))} call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; {507#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} is VALID [2022-02-21 03:35:21,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} assume !(0 == cstrncmp_~n#1); {507#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} is VALID [2022-02-21 03:35:21,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {507#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; {507#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} is VALID [2022-02-21 03:35:21,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {507#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; {507#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} is VALID [2022-02-21 03:35:21,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {507#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; {507#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} is VALID [2022-02-21 03:35:21,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {507#(= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)} assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; {508#|ULTIMATE.start_cstrncmp_#t~short210#1|} is VALID [2022-02-21 03:35:21,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {508#|ULTIMATE.start_cstrncmp_#t~short210#1|} assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; {502#false} is VALID [2022-02-21 03:35:21,270 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:35:21,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:21,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655376358] [2022-02-21 03:35:21,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655376358] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:21,270 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:21,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:35:21,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018287268] [2022-02-21 03:35:21,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:21,441 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:21,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:35:21,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:35:21,442 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:21,618 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-02-21 03:35:21,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:35:21,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:21,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2022-02-21 03:35:21,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:21,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2022-02-21 03:35:21,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 03:35:21,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 03:35:21,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2022-02-21 03:35:21,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:21,633 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 03:35:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2022-02-21 03:35:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-21 03:35:21,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:21,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,634 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,634 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:21,635 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 03:35:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-21 03:35:21,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:21,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:21,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 26 transitions. [2022-02-21 03:35:21,635 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 26 transitions. [2022-02-21 03:35:21,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:21,636 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 03:35:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-21 03:35:21,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:21,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:21,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:21,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-02-21 03:35:21,636 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-21 03:35:21,636 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-21 03:35:21,636 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:35:21,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2022-02-21 03:35:21,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:21,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:21,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:21,637 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:21,637 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:21,637 INFO L791 eck$LassoCheckResult]: Stem: 550#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 551#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 546#L383 assume !(main_~length1~0#1 < 1); 547#L383-2 assume !(main_~length2~0#1 < 1); 558#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 559#L391-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; 548#L391-2 main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; 549#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 563#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 552#L396-3 assume !(main_~i~1#1 > 0); 553#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 560#L368 assume !(0 == cstrncmp_~n#1); 561#L370-5 [2022-02-21 03:35:21,637 INFO L793 eck$LassoCheckResult]: Loop: 561#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 562#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 556#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 557#L371 assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; 564#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 561#L370-5 [2022-02-21 03:35:21,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1351083896, now seen corresponding path program 1 times [2022-02-21 03:35:21,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134312971] [2022-02-21 03:35:21,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,651 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,659 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:21,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,660 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 2 times [2022-02-21 03:35:21,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048588997] [2022-02-21 03:35:21,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,666 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,670 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:21,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,670 INFO L85 PathProgramCache]: Analyzing trace with hash -350531861, now seen corresponding path program 1 times [2022-02-21 03:35:21,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027774198] [2022-02-21 03:35:21,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:21,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {612#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {612#true} is VALID [2022-02-21 03:35:21,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {612#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; {612#true} is VALID [2022-02-21 03:35:21,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {612#true} assume !(main_~length1~0#1 < 1); {612#true} is VALID [2022-02-21 03:35:21,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {612#true} assume !(main_~length2~0#1 < 1); {612#true} is VALID [2022-02-21 03:35:21,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {612#true} call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; {614#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 03:35:21,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {614#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) |ULTIMATE.start_main_~length2~0#1|))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; {614#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 03:35:21,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {614#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) |ULTIMATE.start_main_~length2~0#1|))} main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; {614#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 03:35:21,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {614#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 03:35:21,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {614#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) |ULTIMATE.start_main_~length2~0#1|))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; {615#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (+ |ULTIMATE.start_main_~i~1#1| 1)))} is VALID [2022-02-21 03:35:21,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {615#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) (+ |ULTIMATE.start_main_~i~1#1| 1)))} assume !(main_~i~1#1 > 0); {616#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) 1))} is VALID [2022-02-21 03:35:21,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {616#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|) 1))} call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; {617#(and (or (<= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0) (<= (select |#length| |ULTIMATE.start_cstrncmp_~s2#1.base|) 1)) (or (not (= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0)) (= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s2#1.base|) |ULTIMATE.start_cstrncmp_~s2#1.offset|) 0)))} is VALID [2022-02-21 03:35:21,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {617#(and (or (<= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0) (<= (select |#length| |ULTIMATE.start_cstrncmp_~s2#1.base|) 1)) (or (not (= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0)) (= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s2#1.base|) |ULTIMATE.start_cstrncmp_~s2#1.offset|) 0)))} assume !(0 == cstrncmp_~n#1); {617#(and (or (<= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0) (<= (select |#length| |ULTIMATE.start_cstrncmp_~s2#1.base|) 1)) (or (not (= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0)) (= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s2#1.base|) |ULTIMATE.start_cstrncmp_~s2#1.offset|) 0)))} is VALID [2022-02-21 03:35:21,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {617#(and (or (<= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0) (<= (select |#length| |ULTIMATE.start_cstrncmp_~s2#1.base|) 1)) (or (not (= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0)) (= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s2#1.base|) |ULTIMATE.start_cstrncmp_~s2#1.offset|) 0)))} cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; {617#(and (or (<= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0) (<= (select |#length| |ULTIMATE.start_cstrncmp_~s2#1.base|) 1)) (or (not (= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0)) (= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s2#1.base|) |ULTIMATE.start_cstrncmp_~s2#1.offset|) 0)))} is VALID [2022-02-21 03:35:21,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {617#(and (or (<= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0) (<= (select |#length| |ULTIMATE.start_cstrncmp_~s2#1.base|) 1)) (or (not (= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0)) (= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s2#1.base|) |ULTIMATE.start_cstrncmp_~s2#1.offset|) 0)))} assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; {618#(and (= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0) (or (not |ULTIMATE.start_cstrncmp_#t~short208#1|) (= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)))} is VALID [2022-02-21 03:35:21,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {618#(and (= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0) (or (not |ULTIMATE.start_cstrncmp_#t~short208#1|) (= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0)))} assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; {619#(and (= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0))} is VALID [2022-02-21 03:35:21,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {619#(and (= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_cstrncmp_~s1#1.base|) |ULTIMATE.start_cstrncmp_~s1#1.offset|) 0))} assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; {620#(and (= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0) |ULTIMATE.start_cstrncmp_#t~short210#1|)} is VALID [2022-02-21 03:35:21,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {620#(and (= |ULTIMATE.start_cstrncmp_~s2#1.offset| 0) |ULTIMATE.start_cstrncmp_#t~short210#1|)} assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; {613#false} is VALID [2022-02-21 03:35:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:35:21,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:21,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027774198] [2022-02-21 03:35:21,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027774198] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:21,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:21,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 03:35:21,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763474033] [2022-02-21 03:35:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:21,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:21,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:35:21,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:35:21,966 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,206 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-21 03:35:22,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:35:22,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:22,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2022-02-21 03:35:22,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:22,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 33 transitions. [2022-02-21 03:35:22,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-02-21 03:35:22,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-02-21 03:35:22,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33 transitions. [2022-02-21 03:35:22,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:22,234 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-02-21 03:35:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 33 transitions. [2022-02-21 03:35:22,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-02-21 03:35:22,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:22,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 33 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,235 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 33 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,235 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,236 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-02-21 03:35:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-21 03:35:22,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:22,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:22,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states and 33 transitions. [2022-02-21 03:35:22,237 INFO L87 Difference]: Start difference. First operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states and 33 transitions. [2022-02-21 03:35:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,237 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-02-21 03:35:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-21 03:35:22,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:22,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:22,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:22,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-02-21 03:35:22,238 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-02-21 03:35:22,238 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-02-21 03:35:22,238 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:35:22,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2022-02-21 03:35:22,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:22,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:22,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:22,239 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:22,239 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:22,239 INFO L791 eck$LassoCheckResult]: Stem: 663#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 664#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 661#L383 assume !(main_~length1~0#1 < 1); 662#L383-2 assume !(main_~length2~0#1 < 1); 676#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 677#L391-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; 665#L391-2 main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; 666#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 679#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 667#L396-3 assume !(main_~i~1#1 > 0); 668#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 683#L368 assume !(0 == cstrncmp_~n#1); 682#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 678#L370-1 assume !cstrncmp_#t~short208#1; 672#L370-3 [2022-02-21 03:35:22,239 INFO L793 eck$LassoCheckResult]: Loop: 672#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 673#L371 assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; 680#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 675#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 681#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 672#L370-3 [2022-02-21 03:35:22,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1311502365, now seen corresponding path program 1 times [2022-02-21 03:35:22,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931347979] [2022-02-21 03:35:22,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,256 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,264 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash 89863848, now seen corresponding path program 3 times [2022-02-21 03:35:22,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402869843] [2022-02-21 03:35:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,271 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,274 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:22,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1796409332, now seen corresponding path program 1 times [2022-02-21 03:35:22,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793851267] [2022-02-21 03:35:22,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:22,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {745#true} is VALID [2022-02-21 03:35:22,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {745#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; {745#true} is VALID [2022-02-21 03:35:22,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {745#true} assume !(main_~length1~0#1 < 1); {745#true} is VALID [2022-02-21 03:35:22,297 INFO L290 TraceCheckUtils]: 3: Hoare triple {745#true} assume !(main_~length2~0#1 < 1); {745#true} is VALID [2022-02-21 03:35:22,297 INFO L290 TraceCheckUtils]: 4: Hoare triple {745#true} call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; {745#true} is VALID [2022-02-21 03:35:22,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {745#true} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; {745#true} is VALID [2022-02-21 03:35:22,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {745#true} main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; {745#true} is VALID [2022-02-21 03:35:22,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {745#true} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {745#true} is VALID [2022-02-21 03:35:22,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {745#true} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; {745#true} is VALID [2022-02-21 03:35:22,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {745#true} assume !(main_~i~1#1 > 0); {745#true} is VALID [2022-02-21 03:35:22,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {745#true} call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; {745#true} is VALID [2022-02-21 03:35:22,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {745#true} assume !(0 == cstrncmp_~n#1); {745#true} is VALID [2022-02-21 03:35:22,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {745#true} cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; {745#true} is VALID [2022-02-21 03:35:22,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {745#true} assume !cstrncmp_#t~short208#1; {747#(not |ULTIMATE.start_cstrncmp_#t~short208#1|)} is VALID [2022-02-21 03:35:22,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {747#(not |ULTIMATE.start_cstrncmp_#t~short208#1|)} assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; {746#false} is VALID [2022-02-21 03:35:22,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {746#false} assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; {746#false} is VALID [2022-02-21 03:35:22,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {746#false} assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; {746#false} is VALID [2022-02-21 03:35:22,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {746#false} cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; {746#false} is VALID [2022-02-21 03:35:22,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {746#false} assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; {746#false} is VALID [2022-02-21 03:35:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:35:22,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:22,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793851267] [2022-02-21 03:35:22,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793851267] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:22,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:22,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:35:22,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242753610] [2022-02-21 03:35:22,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:22,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:22,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:35:22,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:35:22,567 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,599 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-02-21 03:35:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:35:22,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:22,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2022-02-21 03:35:22,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:22,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 23 transitions. [2022-02-21 03:35:22,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 03:35:22,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 03:35:22,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2022-02-21 03:35:22,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:22,613 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-21 03:35:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2022-02-21 03:35:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-21 03:35:22,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:22,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 23 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,614 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 23 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,614 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,614 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-21 03:35:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-21 03:35:22,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:22,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:22,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 23 transitions. [2022-02-21 03:35:22,614 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 23 transitions. [2022-02-21 03:35:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,615 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-21 03:35:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-21 03:35:22,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:22,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:22,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:22,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-02-21 03:35:22,616 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-21 03:35:22,616 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-21 03:35:22,616 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:35:22,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2022-02-21 03:35:22,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:35:22,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:22,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:22,616 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:22,616 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:22,616 INFO L791 eck$LassoCheckResult]: Stem: 774#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 775#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; 772#L383 assume !(main_~length1~0#1 < 1); 773#L383-2 assume !(main_~length2~0#1 < 1); 784#L386-1 call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; 785#L391-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; 776#L391-2 main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; 777#L391-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 789#L391-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; 778#L396-3 assume !!(main_~i~1#1 > 0);call write~int(main_#t~nondet223#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet223#1; 779#L396-2 main_#t~post222#1 := main_~i~1#1;main_~i~1#1 := main_#t~post222#1 - 1;havoc main_#t~post222#1; 780#L396-3 assume !(main_~i~1#1 > 0); 781#L396-4 call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; 786#L368 assume !(0 == cstrncmp_~n#1); 787#L370-5 [2022-02-21 03:35:22,619 INFO L793 eck$LassoCheckResult]: Loop: 787#L370-5 cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; 788#L370-1 assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; 782#L370-3 assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; 783#L371 assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; 790#L371-2 assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; 787#L370-5 [2022-02-21 03:35:22,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1313217430, now seen corresponding path program 1 times [2022-02-21 03:35:22,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344414952] [2022-02-21 03:35:22,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,631 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,637 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:22,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash 79307778, now seen corresponding path program 4 times [2022-02-21 03:35:22,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169799479] [2022-02-21 03:35:22,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,643 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,646 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:22,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1018233459, now seen corresponding path program 1 times [2022-02-21 03:35:22,647 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,647 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027053160] [2022-02-21 03:35:22,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,662 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,671 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:23,700 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:23,700 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:23,700 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:23,700 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:23,700 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:23,700 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,700 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:23,700 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:23,700 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_mixed_alloca.i_Iteration7_Lasso [2022-02-21 03:35:23,700 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:23,700 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:23,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:35:23,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:35:23,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:35:23,721 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:35:23,723 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:35:23,724 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:35:23,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:35:23,736 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:35:23,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:35:23,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:35:23,740 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:35:23,755 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:35:23,757 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:35:23,759 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:35:23,761 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:35:23,763 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:35:23,765 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:35:23,767 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:35:23,768 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:35:23,776 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:35:23,778 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:35:23,779 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:35:23,781 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:35:23,783 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:35:23,784 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:35:23,786 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:35:23,788 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:35:23,790 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:35:23,793 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:35:24,703 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:35:24,707 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:35:25,431 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:25,431 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:25,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,435 INFO L229 MonitoredProcess]: Starting monitored process 23 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:35:25,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:35:25,451 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:35:25,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:25,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,484 INFO L229 MonitoredProcess]: Starting monitored process 24 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:35:25,500 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:35:25,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:25,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:35:25,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,536 INFO L229 MonitoredProcess]: Starting monitored process 25 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:35:25,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:35:25,539 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:35:25,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:25,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,579 INFO L229 MonitoredProcess]: Starting monitored process 26 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:35:25,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:35:25,581 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:35:25,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:25,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,618 INFO L229 MonitoredProcess]: Starting monitored process 27 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:35:25,621 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:35:25,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:25,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:35:25,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,658 INFO L229 MonitoredProcess]: Starting monitored process 28 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:35:25,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:35:25,660 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:35:25,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,691 INFO L229 MonitoredProcess]: Starting monitored process 29 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:35:25,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:35:25,694 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:35:25,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:25,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,732 INFO L229 MonitoredProcess]: Starting monitored process 30 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:35:25,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:35:25,734 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:35:25,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:25,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,772 INFO L229 MonitoredProcess]: Starting monitored process 31 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:35:25,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:35:25,774 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:35:25,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:25,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 03:35:25,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,806 INFO L229 MonitoredProcess]: Starting monitored process 32 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:35:25,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:35:25,808 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:35:25,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:25,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 03:35:25,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,844 INFO L229 MonitoredProcess]: Starting monitored process 33 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:35:25,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:35:25,846 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:35:25,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,877 INFO L229 MonitoredProcess]: Starting monitored process 34 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:35:25,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:35:25,882 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:35:25,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:25,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,907 INFO L229 MonitoredProcess]: Starting monitored process 35 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:35:25,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:35:25,910 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:35:25,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:25,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,949 INFO L229 MonitoredProcess]: Starting monitored process 36 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:35:25,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:35:25,952 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:35:25,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:25,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,993 INFO L229 MonitoredProcess]: Starting monitored process 37 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:35:25,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:35:25,995 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:35:26,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:26,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:26,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:35:26,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,023 INFO L229 MonitoredProcess]: Starting monitored process 38 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:35:26,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:35:26,025 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:35:26,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:26,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,088 INFO L229 MonitoredProcess]: Starting monitored process 39 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:35:26,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:35:26,091 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:35:26,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-02-21 03:35:26,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,123 INFO L229 MonitoredProcess]: Starting monitored process 40 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:35:26,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:35:26,125 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:35:26,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:26,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:26,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:26,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:26,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:26,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:26,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,154 INFO L229 MonitoredProcess]: Starting monitored process 41 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:35:26,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:35:26,158 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:35:26,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:26,164 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-02-21 03:35:26,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:26,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:26,177 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-02-21 03:35:26,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:26,191 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:26,210 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-02-21 03:35:26,211 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-02-21 03:35:26,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:26,212 INFO L229 MonitoredProcess]: Starting monitored process 42 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:35:26,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:35:26,215 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:26,236 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:26,236 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:26,236 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~n#1) = 1*ULTIMATE.start_cstrncmp_~n#1 Supporting invariants [] [2022-02-21 03:35:26,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:26,386 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2022-02-21 03:35:26,389 INFO L390 LassoCheck]: Loop: "cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0;" "assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1;" "assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1;" "assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1;" "assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset;" [2022-02-21 03:35:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:26,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {838#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {838#unseeded} is VALID [2022-02-21 03:35:26,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet216#1, main_#t~nondet217#1, main_#t~malloc218#1.base, main_#t~malloc218#1.offset, main_#t~malloc219#1.base, main_#t~malloc219#1.offset, main_#t~nondet221#1, main_#t~post220#1, main_~i~0#1, main_#t~nondet223#1, main_#t~post222#1, main_~i~1#1, main_#t~nondet224#1, main_#t~ret225#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet216#1;havoc main_#t~nondet216#1;main_~length2~0#1 := main_#t~nondet217#1;havoc main_#t~nondet217#1; {838#unseeded} is VALID [2022-02-21 03:35:26,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {838#unseeded} assume !(main_~length1~0#1 < 1); {838#unseeded} is VALID [2022-02-21 03:35:26,486 INFO L290 TraceCheckUtils]: 3: Hoare triple {838#unseeded} assume !(main_~length2~0#1 < 1); {838#unseeded} is VALID [2022-02-21 03:35:26,487 INFO L290 TraceCheckUtils]: 4: Hoare triple {838#unseeded} call main_#t~malloc218#1.base, main_#t~malloc218#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc218#1.base, main_#t~malloc218#1.offset;call main_#t~malloc219#1.base, main_#t~malloc219#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc219#1.base, main_#t~malloc219#1.offset;main_~i~0#1 := 0; {838#unseeded} is VALID [2022-02-21 03:35:26,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {838#unseeded} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet221#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet221#1; {838#unseeded} is VALID [2022-02-21 03:35:26,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {838#unseeded} main_#t~post220#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post220#1;havoc main_#t~post220#1; {838#unseeded} is VALID [2022-02-21 03:35:26,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {838#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {838#unseeded} is VALID [2022-02-21 03:35:26,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {838#unseeded} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);main_~i~1#1 := main_~length2~0#1 - 1; {838#unseeded} is VALID [2022-02-21 03:35:26,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#unseeded} assume !!(main_~i~1#1 > 0);call write~int(main_#t~nondet223#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet223#1; {838#unseeded} is VALID [2022-02-21 03:35:26,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {838#unseeded} main_#t~post222#1 := main_~i~1#1;main_~i~1#1 := main_#t~post222#1 - 1;havoc main_#t~post222#1; {838#unseeded} is VALID [2022-02-21 03:35:26,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {838#unseeded} assume !(main_~i~1#1 > 0); {838#unseeded} is VALID [2022-02-21 03:35:26,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {838#unseeded} call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_#t~nondet224#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem209#1, cstrncmp_#t~short210#1, cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset, cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset, cstrncmp_#t~post205#1, cstrncmp_#t~mem206#1, cstrncmp_#t~mem207#1, cstrncmp_#t~short208#1, cstrncmp_#t~mem213#1, cstrncmp_#t~mem214#1, cstrncmp_#t~ite215#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1, cstrncmp_~uc1~0#1, cstrncmp_~uc2~0#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1;havoc cstrncmp_~uc1~0#1;havoc cstrncmp_~uc2~0#1; {838#unseeded} is VALID [2022-02-21 03:35:26,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {838#unseeded} assume !(0 == cstrncmp_~n#1); {838#unseeded} is VALID [2022-02-21 03:35:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:35:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:26,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:26,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {841#(>= oldRank0 |ULTIMATE.start_cstrncmp_~n#1|)} cstrncmp_#t~post205#1 := cstrncmp_~n#1;cstrncmp_~n#1 := cstrncmp_#t~post205#1 - 1;cstrncmp_#t~short208#1 := cstrncmp_#t~post205#1 > 0; {1010#(or (and (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) 0) (not |ULTIMATE.start_cstrncmp_#t~short208#1|) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0)) (and (< 0 oldRank0) |ULTIMATE.start_cstrncmp_#t~short208#1| (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0)))} is VALID [2022-02-21 03:35:26,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {1010#(or (and (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) 0) (not |ULTIMATE.start_cstrncmp_#t~short208#1|) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0)) (and (< 0 oldRank0) |ULTIMATE.start_cstrncmp_#t~short208#1| (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0)))} assume cstrncmp_#t~short208#1;call cstrncmp_#t~mem206#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);call cstrncmp_#t~mem207#1 := read~int(cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, 1);cstrncmp_#t~short208#1 := cstrncmp_#t~mem206#1 == cstrncmp_#t~mem207#1; {1014#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0))} is VALID [2022-02-21 03:35:26,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {1014#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0))} assume !!cstrncmp_#t~short208#1;havoc cstrncmp_#t~post205#1;havoc cstrncmp_#t~mem206#1;havoc cstrncmp_#t~mem207#1;havoc cstrncmp_#t~short208#1;cstrncmp_#t~short210#1 := 0 == cstrncmp_~n#1; {1014#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0))} is VALID [2022-02-21 03:35:26,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {1014#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0))} assume !cstrncmp_#t~short210#1;call cstrncmp_#t~mem209#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~short210#1 := 0 == cstrncmp_#t~mem209#1; {1014#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0))} is VALID [2022-02-21 03:35:26,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {1014#(and (< 0 oldRank0) (<= (+ |ULTIMATE.start_cstrncmp_~n#1| 1) oldRank0))} assume !cstrncmp_#t~short210#1;havoc cstrncmp_#t~mem209#1;havoc cstrncmp_#t~short210#1;cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post211#1.base, 1 + cstrncmp_#t~post211#1.offset;havoc cstrncmp_#t~post211#1.base, cstrncmp_#t~post211#1.offset;cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset - 1;havoc cstrncmp_#t~post212#1.base, cstrncmp_#t~post212#1.offset; {966#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_cstrncmp_~n#1|)) unseeded)} is VALID [2022-02-21 03:35:26,730 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:35:26,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:26,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:26,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:26,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,746 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:35:26,746 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:26,796 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 29 transitions. Complement of second has 6 states. [2022-02-21 03:35:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:26,797 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:26,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. cyclomatic complexity: 7 [2022-02-21 03:35:26,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:26,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:26,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:26,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:26,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:26,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:26,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2022-02-21 03:35:26,798 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:26,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:26,799 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 23 transitions. cyclomatic complexity: 7 [2022-02-21 03:35:26,799 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:35:26,803 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:26,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:26,804 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:26,804 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 29 transitions. cyclomatic complexity: 7 [2022-02-21 03:35:26,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. cyclomatic complexity: 7 [2022-02-21 03:35:26,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:26,804 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:35:26,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:26,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:26,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:26,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:26,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 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:35:26,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:26,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:26,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:26,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 7 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:26,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:35:26,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:35:26,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:35:26,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:26,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:26,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:26,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:26,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:26,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:26,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:35:26,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:35:26,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:35:26,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:35:26,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:35:26,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:35:26,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:35:26,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:35:26,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:35:26,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:35:26,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:35:26,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 7 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:35:26,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:26,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 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:35:26,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 29 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:26,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,817 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-02-21 03:35:26,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:35:26,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:35:26,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:35:26,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:26,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. cyclomatic complexity: 7 [2022-02-21 03:35:26,831 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:26,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2022-02-21 03:35:26,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:35:26,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:35:26,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:35:26,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:26,831 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:26,831 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:26,831 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:26,831 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:35:26,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:35:26,832 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:26,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:26,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:35:26 BoogieIcfgContainer [2022-02-21 03:35:26,837 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:35:26,837 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:35:26,837 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:35:26,837 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:35:26,838 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:17" (3/4) ... [2022-02-21 03:35:26,839 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:35:26,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:35:26,856 INFO L158 Benchmark]: Toolchain (without parser) took 10490.30ms. Allocated memory was 86.0MB in the beginning and 159.4MB in the end (delta: 73.4MB). Free memory was 48.7MB in the beginning and 67.5MB in the end (delta: -18.9MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. [2022-02-21 03:35:26,857 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 86.0MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:26,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.33ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 48.5MB in the beginning and 69.9MB in the end (delta: -21.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:35:26,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.56ms. Allocated memory is still 104.9MB. Free memory was 69.9MB in the beginning and 67.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:26,858 INFO L158 Benchmark]: Boogie Preprocessor took 34.98ms. Allocated memory is still 104.9MB. Free memory was 67.6MB in the beginning and 65.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:26,858 INFO L158 Benchmark]: RCFGBuilder took 388.89ms. Allocated memory is still 104.9MB. Free memory was 65.8MB in the beginning and 50.4MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 03:35:26,858 INFO L158 Benchmark]: BuchiAutomizer took 9667.34ms. Allocated memory was 104.9MB in the beginning and 159.4MB in the end (delta: 54.5MB). Free memory was 50.4MB in the beginning and 67.5MB in the end (delta: -17.1MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2022-02-21 03:35:26,861 INFO L158 Benchmark]: Witness Printer took 18.10ms. Allocated memory is still 159.4MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:26,864 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.14ms. Allocated memory is still 86.0MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.33ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 48.5MB in the beginning and 69.9MB in the end (delta: -21.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.56ms. Allocated memory is still 104.9MB. Free memory was 69.9MB in the beginning and 67.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.98ms. Allocated memory is still 104.9MB. Free memory was 67.6MB in the beginning and 65.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 388.89ms. Allocated memory is still 104.9MB. Free memory was 65.8MB in the beginning and 50.4MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 9667.34ms. Allocated memory was 104.9MB in the beginning and 159.4MB in the end (delta: 54.5MB). Free memory was 50.4MB in the beginning and 67.5MB in the end (delta: -17.1MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * Witness Printer took 18.10ms. Allocated memory is still 159.4MB. Free memory is still 67.5MB. 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 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function n and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.6s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 8.0s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 359 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 222 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 161 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 137 mSDtfsCounter, 161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital182 mio100 ax100 hnf100 lsp90 ukn87 mio100 lsp47 div100 bol100 ite100 ukn100 eq175 hnf90 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 85ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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:35:26,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE