./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/cstrpbrk-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 4f4570e8b350d1c6ecce62e4659f1c324ac9794563382f5f25c3525057748138 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:01,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:01,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:01,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:01,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:01,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:01,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:01,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:01,241 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:01,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:01,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:01,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:01,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:01,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:01,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:01,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:01,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:01,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:01,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:01,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:01,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:01,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:01,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:01,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:01,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:01,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:01,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:01,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:01,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:01,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:01,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:01,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:01,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:01,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:01,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:01,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:01,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:01,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:01,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:01,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:01,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:01,274 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:35:01,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:01,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:01,303 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:01,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:01,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:01,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:01,305 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:01,305 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:01,305 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:01,305 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:01,306 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:01,306 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:01,306 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:01,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:01,306 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:01,306 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:01,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:01,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:01,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:01,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:01,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:01,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:01,307 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:01,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:01,308 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:01,308 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:01,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:01,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:01,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:01,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:01,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:01,309 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:01,309 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f4570e8b350d1c6ecce62e4659f1c324ac9794563382f5f25c3525057748138 [2022-02-21 04:35:01,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:01,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:01,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:01,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:01,540 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:01,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2022-02-21 04:35:01,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f172f8090/8d8c1621360e4ce8972ac4077ada2d73/FLAG21798597a [2022-02-21 04:35:01,946 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:01,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2022-02-21 04:35:01,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f172f8090/8d8c1621360e4ce8972ac4077ada2d73/FLAG21798597a [2022-02-21 04:35:02,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f172f8090/8d8c1621360e4ce8972ac4077ada2d73 [2022-02-21 04:35:02,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:02,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:02,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:02,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:02,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:02,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:02" (1/1) ... [2022-02-21 04:35:02,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@724a8e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:02, skipping insertion in model container [2022-02-21 04:35:02,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:02" (1/1) ... [2022-02-21 04:35:02,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:02,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:02,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:02,659 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:02,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:02,711 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:02,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:02 WrapperNode [2022-02-21 04:35:02,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:02,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:02,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:02,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:02,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:02" (1/1) ... [2022-02-21 04:35:02,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:02" (1/1) ... [2022-02-21 04:35:02,767 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2022-02-21 04:35:02,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:02,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:02,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:02,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:02,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:02" (1/1) ... [2022-02-21 04:35:02,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:02" (1/1) ... [2022-02-21 04:35:02,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:02" (1/1) ... [2022-02-21 04:35:02,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:02" (1/1) ... [2022-02-21 04:35:02,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:02" (1/1) ... [2022-02-21 04:35:02,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:02" (1/1) ... [2022-02-21 04:35:02,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:02" (1/1) ... [2022-02-21 04:35:02,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:02,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:02,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:02,804 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:02,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:02" (1/1) ... [2022-02-21 04:35:02,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:02,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:02,830 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 04:35:02,833 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 04:35:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:02,944 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:02,945 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:03,152 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:03,162 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:03,162 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-21 04:35:03,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:03 BoogieIcfgContainer [2022-02-21 04:35:03,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:03,164 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:03,164 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:03,167 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:03,167 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:03,167 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:02" (1/3) ... [2022-02-21 04:35:03,168 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@386d56b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:03, skipping insertion in model container [2022-02-21 04:35:03,168 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:03,168 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:02" (2/3) ... [2022-02-21 04:35:03,168 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@386d56b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:03, skipping insertion in model container [2022-02-21 04:35:03,168 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:03,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:03" (3/3) ... [2022-02-21 04:35:03,170 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrpbrk-alloca-2.i [2022-02-21 04:35:03,199 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:03,199 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:03,199 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:03,199 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:03,199 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:03,199 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:03,199 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:03,200 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:03,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:03,231 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 04:35:03,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:03,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:03,250 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:03,250 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:03,250 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:03,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:03,257 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 04:35:03,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:03,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:03,258 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:03,258 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:03,263 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; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 11#L532true assume !(main_~length1~0#1 < 1); 6#L532-2true assume !(main_~length2~0#1 < 1); 3#L535-1true call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 19#L541-3true [2022-02-21 04:35:03,263 INFO L793 eck$LassoCheckResult]: Loop: 19#L541-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 24#L541-2true main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 19#L541-3true [2022-02-21 04:35:03,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:03,274 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 04:35:03,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:03,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113268468] [2022-02-21 04:35:03,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:03,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:03,357 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:03,406 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-02-21 04:35:03,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:03,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813777] [2022-02-21 04:35:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:03,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:03,434 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:03,445 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:03,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-02-21 04:35:03,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:03,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431646821] [2022-02-21 04:35:03,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:03,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:03,495 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:03,508 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:03,837 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:03,837 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:03,838 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:03,838 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:03,838 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:03,838 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:03,838 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:03,838 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:03,839 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration1_Lasso [2022-02-21 04:35:03,839 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:03,839 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:03,852 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 04:35:03,859 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 04:35:03,862 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 04:35:04,028 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 04:35:04,036 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 04:35:04,038 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 04:35:04,040 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 04:35:04,042 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 04:35:04,044 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 04:35:04,046 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 04:35:04,049 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 04:35:04,051 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 04:35:04,054 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 04:35:04,057 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 04:35:04,059 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 04:35:04,062 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 04:35:04,421 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:04,424 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:04,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,426 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 04:35:04,427 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 04:35:04,429 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 04:35:04,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:04,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:04,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:04,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:35:04,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,470 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 04:35:04,473 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 04:35:04,473 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 04:35:04,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:04,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:04,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:04,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,502 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 04:35:04,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,503 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 04:35:04,505 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 04:35:04,505 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 04:35:04,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:04,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:04,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,558 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 04:35:04,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,560 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 04:35:04,562 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 04:35:04,562 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 04:35:04,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:04,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:04,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:04,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 04:35:04,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,593 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 04:35:04,594 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 04:35:04,595 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 04:35:04,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:04,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:04,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:04,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:04,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:04,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:04,631 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:04,668 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 04:35:04,669 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-02-21 04:35:04,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:04,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:04,680 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 04:35:04,681 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 04:35:04,746 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:04,768 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:04,768 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:04,769 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 04:35:04,786 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 04:35:04,821 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:35:04,853 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1;" "main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2022-02-21 04:35:04,857 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 04:35:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:04,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:04,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:04,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:04,929 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 04:35:04,929 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~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {34#unseeded} is VALID [2022-02-21 04:35:04,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#unseeded} assume !(main_~length1~0#1 < 1); {34#unseeded} is VALID [2022-02-21 04:35:04,930 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#unseeded} assume !(main_~length2~0#1 < 1); {34#unseeded} is VALID [2022-02-21 04:35:04,930 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {34#unseeded} is VALID [2022-02-21 04:35:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:04,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:04,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:04,964 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~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#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 04:35:04,965 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~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#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 04:35:04,965 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 04:35:04,989 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 04:35:04,995 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 04:35:04,997 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 04:35:04,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,001 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 04:35:05,003 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,096 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 87 transitions. Complement of second has 7 states. [2022-02-21 04:35:05,097 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 04:35:05,097 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:05,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,106 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 04:35:05,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:05,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:05,107 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 04:35:05,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:05,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:05,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:05,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 87 transitions. [2022-02-21 04:35:05,117 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-02-21 04:35:05,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:05,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:05,120 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,124 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 04:35:05,127 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 04:35:05,128 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 04:35:05,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:05,131 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:05,132 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 87 transitions. cyclomatic complexity: 34 [2022-02-21 04:35:05,134 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:35:05,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,137 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 04:35:05,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:05,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,138 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 04:35:05,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:05,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,140 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 04:35:05,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:05,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,142 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 04:35:05,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 60 letters. Loop has 60 letters. [2022-02-21 04:35:05,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,147 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 04:35:05,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 24 letters. [2022-02-21 04:35:05,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,148 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 04:35:05,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:05,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 6 letters. [2022-02-21 04:35:05,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,149 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 6 letters. [2022-02-21 04:35:05,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 6 letters. [2022-02-21 04:35:05,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 6 letters. [2022-02-21 04:35:05,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,151 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 6 letters. [2022-02-21 04:35:05,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 6 letters. [2022-02-21 04:35:05,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 6 letters. [2022-02-21 04:35:05,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,154 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 6 letters. [2022-02-21 04:35:05,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 6 letters. [2022-02-21 04:35:05,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 9 letters. Loop has 6 letters. [2022-02-21 04:35:05,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,155 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 9 letters. Loop has 6 letters. [2022-02-21 04:35:05,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 6 letters. [2022-02-21 04:35:05,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 3 letters. [2022-02-21 04:35:05,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,157 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 3 letters. [2022-02-21 04:35:05,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:05,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 3 letters. [2022-02-21 04:35:05,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,158 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 3 letters. [2022-02-21 04:35:05,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:05,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 6 letters. [2022-02-21 04:35:05,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,158 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 6 letters. [2022-02-21 04:35:05,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 6 letters. [2022-02-21 04:35:05,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 3 letters. [2022-02-21 04:35:05,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,159 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 3 letters. [2022-02-21 04:35:05,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:05,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,160 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 04:35:05,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:05,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,161 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 04:35:05,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:05,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,162 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 04:35:05,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:05,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,162 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 04:35:05,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:05,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,163 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 04:35:05,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:05,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,164 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 04:35:05,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:05,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 8 letters. [2022-02-21 04:35:05,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,165 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 8 letters. [2022-02-21 04:35:05,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:35:05,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 9 letters. Loop has 8 letters. [2022-02-21 04:35:05,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,165 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 9 letters. Loop has 8 letters. [2022-02-21 04:35:05,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:35:05,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 3 letters. [2022-02-21 04:35:05,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,166 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 3 letters. [2022-02-21 04:35:05,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:05,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 8 letters. [2022-02-21 04:35:05,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,167 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 15 letters. Loop has 8 letters. [2022-02-21 04:35:05,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:35:05,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 8 letters. [2022-02-21 04:35:05,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,168 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 16 letters. Loop has 8 letters. [2022-02-21 04:35:05,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:05,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 8 letters. [2022-02-21 04:35:05,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,169 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 8 letters. [2022-02-21 04:35:05,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:35:05,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 3 letters. [2022-02-21 04:35:05,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,170 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 3 letters. [2022-02-21 04:35:05,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:05,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 3 letters. [2022-02-21 04:35:05,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,171 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 3 letters. [2022-02-21 04:35:05,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:05,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,172 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 04:35:05,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:05,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 04:35:05,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,173 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 04:35:05,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:05,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,173 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:05,176 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 04:35:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-02-21 04:35:05,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:05,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:05,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:35:05,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:05,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. cyclomatic complexity: 34 [2022-02-21 04:35:05,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-02-21 04:35:05,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2022-02-21 04:35:05,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 04:35:05,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 04:35:05,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2022-02-21 04:35:05,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:05,184 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 04:35:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2022-02-21 04:35:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-21 04:35:05,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:05,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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 04:35:05,201 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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 04:35:05,203 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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 04:35:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:05,205 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 04:35:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-02-21 04:35:05,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:05,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:05,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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 20 states and 27 transitions. [2022-02-21 04:35:05,206 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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 20 states and 27 transitions. [2022-02-21 04:35:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:05,207 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 04:35:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-02-21 04:35:05,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:05,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:05,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:05,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 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 04:35:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-02-21 04:35:05,209 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 04:35:05,209 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 04:35:05,209 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:05,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-02-21 04:35:05,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-02-21 04:35:05,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:05,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:05,210 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:05,210 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:05,211 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~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 178#L532 assume !(main_~length1~0#1 < 1); 172#L532-2 assume !(main_~length2~0#1 < 1); 168#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 169#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 179#L541-4 main_~i~1#1 := 0; 175#L546-3 [2022-02-21 04:35:05,211 INFO L793 eck$LassoCheckResult]: Loop: 175#L546-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 177#L546-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 175#L546-3 [2022-02-21 04:35:05,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-02-21 04:35:05,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:05,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776583962] [2022-02-21 04:35:05,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:05,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:05,230 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:05,238 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:05,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:05,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-02-21 04:35:05,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:05,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914461020] [2022-02-21 04:35:05,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:05,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:05,245 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:05,249 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:05,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:05,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2022-02-21 04:35:05,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:05,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190649798] [2022-02-21 04:35:05,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:05,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:05,264 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:05,274 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:05,520 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:05,520 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:05,520 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:05,520 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:05,520 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:05,520 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,520 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:05,520 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:05,520 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration2_Lasso [2022-02-21 04:35:05,520 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:05,520 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:05,522 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 04:35:05,524 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 04:35:05,526 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 04:35:05,528 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 04:35:05,532 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 04:35:05,533 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 04:35:05,535 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 04:35:05,536 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 04:35:05,540 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 04:35:05,541 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 04:35:05,543 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 04:35:05,544 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 04:35:05,545 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 04:35:05,548 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 04:35:05,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:05,951 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:05,952 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:05,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,954 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 04:35:05,961 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 04:35:05,962 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 04:35:05,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:05,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:05,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:05,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:05,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:05,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:05,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:05,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:05,997 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 04:35:05,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:05,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:05,999 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 04:35:05,999 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 04:35:06,001 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 04:35:06,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:06,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:06,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:06,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,031 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 04:35:06,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,033 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 04:35:06,033 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 04:35:06,035 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 04:35:06,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:06,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:06,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:06,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,081 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 04:35:06,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,082 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 04:35:06,083 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 04:35:06,085 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 04:35:06,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:06,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:06,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,122 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 04:35:06,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,124 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 04:35:06,125 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 04:35:06,126 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 04:35:06,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:06,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:06,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:06,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,171 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 04:35:06,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,173 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 04:35:06,185 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 04:35:06,191 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 04:35:06,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:06,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:06,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,227 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 04:35:06,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,228 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 04:35:06,229 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 04:35:06,231 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 04:35:06,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:06,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:06,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:06,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,269 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 04:35:06,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,271 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 04:35:06,272 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 04:35:06,274 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 04:35:06,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:06,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:06,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 04:35:06,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,311 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 04:35:06,311 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 04:35:06,313 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 04:35:06,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:06,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:06,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,358 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 04:35:06,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,360 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 04:35:06,361 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 04:35:06,362 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 04:35:06,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:06,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:06,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:06,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,386 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 04:35:06,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,387 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 04:35:06,388 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 04:35:06,390 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 04:35:06,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:06,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:06,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:06,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,442 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 04:35:06,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,443 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 04:35:06,444 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 04:35:06,446 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 04:35:06,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:06,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:06,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:06,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:06,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,490 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 04:35:06,491 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 04:35:06,493 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 04:35:06,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:06,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:06,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:06,541 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 04:35:06,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,543 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 04:35:06,546 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 04:35:06,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:06,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:06,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:06,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:06,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:06,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:06,563 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 04:35:06,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:06,594 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 04:35:06,594 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-02-21 04:35:06,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,596 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 04:35:06,597 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 04:35:06,598 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:06,628 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:06,628 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:06,628 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~length2~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~length2~0#1 Supporting invariants [] [2022-02-21 04:35:06,646 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 04:35:06,666 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 04:35:06,669 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1;" "main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1;" [2022-02-21 04:35:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:06,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:06,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:06,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:06,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {237#unseeded} is VALID [2022-02-21 04:35:06,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {237#unseeded} is VALID [2022-02-21 04:35:06,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#unseeded} assume !(main_~length1~0#1 < 1); {237#unseeded} is VALID [2022-02-21 04:35:06,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {237#unseeded} assume !(main_~length2~0#1 < 1); {237#unseeded} is VALID [2022-02-21 04:35:06,714 INFO L290 TraceCheckUtils]: 4: Hoare triple {237#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {237#unseeded} is VALID [2022-02-21 04:35:06,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {237#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {237#unseeded} is VALID [2022-02-21 04:35:06,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {237#unseeded} main_~i~1#1 := 0; {237#unseeded} is VALID [2022-02-21 04:35:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:06,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:06,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:06,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#(>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {303#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} is VALID [2022-02-21 04:35:06,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#(and (< (+ |ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~length2~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|))))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {280#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~length2~0#1| (* (- 1) |ULTIMATE.start_main_~i~1#1|)))) unseeded)} is VALID [2022-02-21 04:35:06,743 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 04:35:06,744 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 04:35:06,748 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 04:35:06,748 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 04:35:06,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,749 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 04:35:06,749 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 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 04:35:06,806 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 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 31 states and 44 transitions. Complement of second has 6 states. [2022-02-21 04:35:06,807 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 04:35:06,807 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:06,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. cyclomatic complexity: 10 [2022-02-21 04:35:06,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:06,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:06,809 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 04:35:06,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:06,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:06,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:06,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2022-02-21 04:35:06,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 04:35:06,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:06,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:06,811 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 27 transitions. cyclomatic complexity: 10 [2022-02-21 04:35:06,813 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:35:06,813 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 04:35:06,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:06,814 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:06,814 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 44 transitions. cyclomatic complexity: 17 [2022-02-21 04:35:06,814 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 04:35:06,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:06,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,815 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 04:35:06,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:06,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:06,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,815 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 04:35:06,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:06,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:35:06,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,816 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 9 letters. Loop has 8 letters. [2022-02-21 04:35:06,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:35:06,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 31 letters. Loop has 31 letters. [2022-02-21 04:35:06,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,816 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 31 letters. Loop has 31 letters. [2022-02-21 04:35:06,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 31 letters. Loop has 31 letters. [2022-02-21 04:35:06,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:35:06,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,817 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 20 letters. Loop has 20 letters. [2022-02-21 04:35:06,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:35:06,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:06,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,818 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 04:35:06,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:06,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:35:06,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,818 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 9 letters. Loop has 8 letters. [2022-02-21 04:35:06,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:35:06,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:06,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,819 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 16 letters. Loop has 8 letters. [2022-02-21 04:35:06,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:06,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:06,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,819 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 3 letters. [2022-02-21 04:35:06,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:06,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:06,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,819 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 3 letters. [2022-02-21 04:35:06,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:06,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:35:06,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,820 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 8 letters. [2022-02-21 04:35:06,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:35:06,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:06,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,820 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 3 letters. [2022-02-21 04:35:06,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:06,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:35:06,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,820 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 8 letters. [2022-02-21 04:35:06,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:35:06,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:35:06,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,821 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 15 letters. Loop has 8 letters. [2022-02-21 04:35:06,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:35:06,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:06,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,821 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 04:35:06,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:06,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:06,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,821 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 04:35:06,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:06,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:06,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,822 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 04:35:06,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:06,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:06,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,822 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 3 letters. [2022-02-21 04:35:06,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:35:06,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:06,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,822 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 3 letters. [2022-02-21 04:35:06,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:35:06,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:06,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,823 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 3 letters. [2022-02-21 04:35:06,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:35:06,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:35:06,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,823 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 8 letters. [2022-02-21 04:35:06,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:35:06,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:35:06,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,823 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 15 letters. Loop has 8 letters. [2022-02-21 04:35:06,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 8 letters. [2022-02-21 04:35:06,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:06,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,824 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 16 letters. Loop has 8 letters. [2022-02-21 04:35:06,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:35:06,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:35:06,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,824 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 9 letters. Loop has 8 letters. [2022-02-21 04:35:06,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:35:06,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:35:06,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,824 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 8 letters. [2022-02-21 04:35:06,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:35:06,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,825 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:06,825 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 04:35:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-02-21 04:35:06,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:06,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:06,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:35:06,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:06,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. cyclomatic complexity: 17 [2022-02-21 04:35:06,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 04:35:06,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2022-02-21 04:35:06,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 04:35:06,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 04:35:06,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2022-02-21 04:35:06,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:06,828 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-02-21 04:35:06,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2022-02-21 04:35:06,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-21 04:35:06,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:06,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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 04:35:06,829 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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 04:35:06,829 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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 04:35:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:06,829 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2022-02-21 04:35:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2022-02-21 04:35:06,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:06,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:06,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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 21 states and 29 transitions. [2022-02-21 04:35:06,830 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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 21 states and 29 transitions. [2022-02-21 04:35:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:06,830 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2022-02-21 04:35:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2022-02-21 04:35:06,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:06,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:06,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:06,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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 04:35:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-02-21 04:35:06,831 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-02-21 04:35:06,831 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-02-21 04:35:06,831 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:06,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2022-02-21 04:35:06,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 04:35:06,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:06,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:06,832 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:06,832 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:06,832 INFO L791 eck$LassoCheckResult]: Stem: 349#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 350#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 358#L532 assume !(main_~length1~0#1 < 1); 351#L532-2 assume !(main_~length2~0#1 < 1); 347#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 348#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 360#L541-4 main_~i~1#1 := 0; 354#L546-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 355#L546-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 359#L519-4 [2022-02-21 04:35:06,832 INFO L793 eck$LassoCheckResult]: Loop: 359#L519-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 366#L519-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 362#L522-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 367#L522-1 assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 361#L522-3 assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; 352#L522-6 call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 353#L524 assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; 363#L519-3 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; 359#L519-4 [2022-02-21 04:35:06,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:06,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2022-02-21 04:35:06,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:06,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376506263] [2022-02-21 04:35:06,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:06,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:06,864 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:06,876 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:06,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:06,876 INFO L85 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2022-02-21 04:35:06,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:06,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506774353] [2022-02-21 04:35:06,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:06,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:06,896 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:06,903 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:06,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2022-02-21 04:35:06,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:06,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927258545] [2022-02-21 04:35:06,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:06,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:07,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {417#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {417#true} is VALID [2022-02-21 04:35:07,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {417#true} is VALID [2022-02-21 04:35:07,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume !(main_~length1~0#1 < 1); {417#true} is VALID [2022-02-21 04:35:07,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {417#true} assume !(main_~length2~0#1 < 1); {419#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} is VALID [2022-02-21 04:35:07,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {419#(<= 1 |ULTIMATE.start_main_~length2~0#1|)} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {420#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:07,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {420#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:07,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} main_~i~1#1 := 0; {421#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (= |ULTIMATE.start_main_~i~1#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:07,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (or (= |ULTIMATE.start_main_~i~1#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString2~0#1.offset| |ULTIMATE.start_main_~length2~0#1|) 0)) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {422#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|))} is VALID [2022-02-21 04:35:07,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(and (= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= |ULTIMATE.start_main_~length2~0#1| 1) (<= 1 |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);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {423#(= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s2#1.base|) |ULTIMATE.start_cstrpbrk_~s2#1.offset|) 0)} is VALID [2022-02-21 04:35:07,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {423#(= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s2#1.base|) |ULTIMATE.start_cstrpbrk_~s2#1.offset|) 0)} call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {423#(= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s2#1.base|) |ULTIMATE.start_cstrpbrk_~s2#1.offset|) 0)} is VALID [2022-02-21 04:35:07,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {423#(= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s2#1.base|) |ULTIMATE.start_cstrpbrk_~s2#1.offset|) 0)} assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; {424#(= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) 0)} is VALID [2022-02-21 04:35:07,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#(= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) 0)} call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; {425#(not |ULTIMATE.start_cstrpbrk_#t~short7#1|)} is VALID [2022-02-21 04:35:07,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {425#(not |ULTIMATE.start_cstrpbrk_#t~short7#1|)} assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {418#false} is VALID [2022-02-21 04:35:07,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {418#false} assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; {418#false} is VALID [2022-02-21 04:35:07,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#false} call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {418#false} is VALID [2022-02-21 04:35:07,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {418#false} assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; {418#false} is VALID [2022-02-21 04:35:07,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {418#false} cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; {418#false} is VALID [2022-02-21 04:35:07,075 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 04:35:07,075 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:07,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927258545] [2022-02-21 04:35:07,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927258545] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:07,076 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:07,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 04:35:07,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746717156] [2022-02-21 04:35:07,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:07,151 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 04:35:07,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:07,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 04:35:07,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-21 04:35:07,274 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.8888888888888888) 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 04:35:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:07,472 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-21 04:35:07,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 04:35:07,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) 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 04:35:07,485 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 04:35:07,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2022-02-21 04:35:07,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-02-21 04:35:07,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 42 transitions. [2022-02-21 04:35:07,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-02-21 04:35:07,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-02-21 04:35:07,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2022-02-21 04:35:07,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:07,487 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-02-21 04:35:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2022-02-21 04:35:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-02-21 04:35:07,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:07,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 42 transitions. Second operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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 04:35:07,489 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 42 transitions. Second operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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 04:35:07,489 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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 04:35:07,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:07,490 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-21 04:35:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-21 04:35:07,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:07,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:07,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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 34 states and 42 transitions. [2022-02-21 04:35:07,491 INFO L87 Difference]: Start difference. First operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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 34 states and 42 transitions. [2022-02-21 04:35:07,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:07,492 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-21 04:35:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-21 04:35:07,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:07,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:07,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:07,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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 04:35:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-02-21 04:35:07,493 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-02-21 04:35:07,494 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-02-21 04:35:07,494 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:07,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2022-02-21 04:35:07,494 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-02-21 04:35:07,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:07,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:07,494 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:07,494 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:07,495 INFO L791 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 471#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 480#L532 assume !(main_~length1~0#1 < 1); 472#L532-2 assume !(main_~length2~0#1 < 1); 468#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 469#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 481#L541-4 main_~i~1#1 := 0; 475#L546-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 476#L546-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 482#L519-4 [2022-02-21 04:35:07,495 INFO L793 eck$LassoCheckResult]: Loop: 482#L519-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 487#L519-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 489#L522-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 488#L522-1 assume !cstrpbrk_#t~short7#1; 483#L522-3 assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; 473#L522-6 call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 474#L524 assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; 484#L519-3 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; 482#L519-4 [2022-02-21 04:35:07,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 2 times [2022-02-21 04:35:07,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:07,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951324486] [2022-02-21 04:35:07,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,509 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,518 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:07,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:07,519 INFO L85 PathProgramCache]: Analyzing trace with hash -903038413, now seen corresponding path program 1 times [2022-02-21 04:35:07,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:07,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640730459] [2022-02-21 04:35:07,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:07,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {572#true} call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {574#(= |ULTIMATE.start_cstrpbrk_#t~mem3#1| (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))} is VALID [2022-02-21 04:35:07,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#(= |ULTIMATE.start_cstrpbrk_#t~mem3#1| (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))} assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; {575#(not (= 0 |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 04:35:07,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {575#(not (= 0 |ULTIMATE.start_cstrpbrk_~c~0#1|))} call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; {576#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|)) |ULTIMATE.start_cstrpbrk_#t~short7#1|)} is VALID [2022-02-21 04:35:07,555 INFO L290 TraceCheckUtils]: 3: Hoare triple {576#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|)) |ULTIMATE.start_cstrpbrk_#t~short7#1|)} assume !cstrpbrk_#t~short7#1; {577#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 04:35:07,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {577#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; {577#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 04:35:07,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {577#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {578#(not (= |ULTIMATE.start_cstrpbrk_#t~mem9#1| |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 04:35:07,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#(not (= |ULTIMATE.start_cstrpbrk_#t~mem9#1| |ULTIMATE.start_cstrpbrk_~c~0#1|))} assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; {573#false} is VALID [2022-02-21 04:35:07,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {573#false} cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; {573#false} is VALID [2022-02-21 04:35:07,557 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 04:35:07,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:07,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640730459] [2022-02-21 04:35:07,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640730459] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:07,557 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:07,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 04:35:07,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100949438] [2022-02-21 04:35:07,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:07,558 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:35:07,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:07,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:35:07,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:35:07,559 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 04:35:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:07,682 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-02-21 04:35:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 04:35:07,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 04:35:07,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:07,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2022-02-21 04:35:07,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 04:35:07,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 23 states and 29 transitions. [2022-02-21 04:35:07,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-02-21 04:35:07,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-02-21 04:35:07,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2022-02-21 04:35:07,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:07,690 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-02-21 04:35:07,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2022-02-21 04:35:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-02-21 04:35:07,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:07,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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 04:35:07,691 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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 04:35:07,691 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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 04:35:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:07,691 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-02-21 04:35:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-21 04:35:07,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:07,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:07,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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 23 states and 29 transitions. [2022-02-21 04:35:07,692 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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 23 states and 29 transitions. [2022-02-21 04:35:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:07,692 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-02-21 04:35:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-21 04:35:07,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:07,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:07,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:07,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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 04:35:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-02-21 04:35:07,710 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 04:35:07,710 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 04:35:07,710 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:35:07,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-02-21 04:35:07,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 04:35:07,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:07,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:07,711 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:07,711 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:07,712 INFO L791 eck$LassoCheckResult]: Stem: 623#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 624#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 632#L532 assume !(main_~length1~0#1 < 1); 625#L532-2 assume !(main_~length2~0#1 < 1); 621#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 622#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 633#L541-4 main_~i~1#1 := 0; 628#L546-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 629#L546-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 630#L546-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 631#L546-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 634#L519-4 [2022-02-21 04:35:07,712 INFO L793 eck$LassoCheckResult]: Loop: 634#L519-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 640#L519-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 636#L522-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 641#L522-1 assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 635#L522-3 assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; 626#L522-6 call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 627#L524 assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; 637#L519-3 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; 634#L519-4 [2022-02-21 04:35:07,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2087704584, now seen corresponding path program 1 times [2022-02-21 04:35:07,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:07,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009494768] [2022-02-21 04:35:07,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:07,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,739 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:07,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 2 times [2022-02-21 04:35:07,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:07,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126852689] [2022-02-21 04:35:07,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:07,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,760 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:07,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 949013544, now seen corresponding path program 1 times [2022-02-21 04:35:07,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:07,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566649853] [2022-02-21 04:35:07,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:07,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:07,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {695#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {695#true} is VALID [2022-02-21 04:35:07,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {695#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {695#true} is VALID [2022-02-21 04:35:07,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {695#true} assume !(main_~length1~0#1 < 1); {697#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:07,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {697#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} assume !(main_~length2~0#1 < 1); {697#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:07,891 INFO L290 TraceCheckUtils]: 4: Hoare triple {697#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {698#(and (or (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= |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 04:35:07,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {698#(and (or (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))) (= |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); {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} is VALID [2022-02-21 04:35:07,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} main_~i~1#1 := 0; {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} is VALID [2022-02-21 04:35:07,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} is VALID [2022-02-21 04:35:07,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} is VALID [2022-02-21 04:35:07,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} is VALID [2022-02-21 04:35:07,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {699#(and (not (= |ULTIMATE.start_main_~nondetString2~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {700#(= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) 0)} is VALID [2022-02-21 04:35:07,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {700#(= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) 0)} call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {701#(= |ULTIMATE.start_cstrpbrk_#t~mem3#1| 0)} is VALID [2022-02-21 04:35:07,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {701#(= |ULTIMATE.start_cstrpbrk_#t~mem3#1| 0)} assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; {696#false} is VALID [2022-02-21 04:35:07,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {696#false} call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; {696#false} is VALID [2022-02-21 04:35:07,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {696#false} assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {696#false} is VALID [2022-02-21 04:35:07,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {696#false} assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; {696#false} is VALID [2022-02-21 04:35:07,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {696#false} call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {696#false} is VALID [2022-02-21 04:35:07,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {696#false} assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; {696#false} is VALID [2022-02-21 04:35:07,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {696#false} cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; {696#false} is VALID [2022-02-21 04:35:07,900 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 04:35:07,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:07,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566649853] [2022-02-21 04:35:07,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566649853] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:07,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:07,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 04:35:07,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388787002] [2022-02-21 04:35:07,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:08,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:08,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:35:08,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:35:08,078 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 04:35:08,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:08,215 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-21 04:35:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:35:08,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 04:35:08,231 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 04:35:08,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2022-02-21 04:35:08,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 04:35:08,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 27 transitions. [2022-02-21 04:35:08,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 04:35:08,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 04:35:08,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2022-02-21 04:35:08,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:08,233 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 04:35:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2022-02-21 04:35:08,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-02-21 04:35:08,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:08,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 27 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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 04:35:08,235 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 27 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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 04:35:08,235 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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 04:35:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:08,235 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-21 04:35:08,235 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-21 04:35:08,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:08,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:08,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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 22 states and 27 transitions. [2022-02-21 04:35:08,236 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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 22 states and 27 transitions. [2022-02-21 04:35:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:08,237 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-21 04:35:08,237 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-21 04:35:08,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:08,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:08,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:08,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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 04:35:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-02-21 04:35:08,238 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-02-21 04:35:08,238 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-02-21 04:35:08,238 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:35:08,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2022-02-21 04:35:08,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 04:35:08,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:08,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:08,239 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:08,239 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:08,239 INFO L791 eck$LassoCheckResult]: Stem: 737#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 738#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 746#L532 assume !(main_~length1~0#1 < 1); 739#L532-2 assume !(main_~length2~0#1 < 1); 735#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 736#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 752#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 753#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 747#L541-4 main_~i~1#1 := 0; 742#L546-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 743#L546-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 744#L546-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 745#L546-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 748#L519-4 [2022-02-21 04:35:08,239 INFO L793 eck$LassoCheckResult]: Loop: 748#L519-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 754#L519-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 750#L522-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 755#L522-1 assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 749#L522-3 assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; 740#L522-6 call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 741#L524 assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; 751#L519-3 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; 748#L519-4 [2022-02-21 04:35:08,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:08,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2022-02-21 04:35:08,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:08,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504467796] [2022-02-21 04:35:08,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:08,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:08,257 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:08,275 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:08,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:08,275 INFO L85 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 3 times [2022-02-21 04:35:08,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:08,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44112872] [2022-02-21 04:35:08,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:08,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:08,287 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:08,304 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:08,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:08,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1875279350, now seen corresponding path program 1 times [2022-02-21 04:35:08,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:08,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025563945] [2022-02-21 04:35:08,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:08,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:08,331 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:08,344 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:09,208 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:09,209 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:09,209 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:09,209 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:09,209 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:09,209 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,209 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:09,209 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:09,209 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration6_Lasso [2022-02-21 04:35:09,209 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:09,209 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:09,216 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 04:35:09,218 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 04:35:09,220 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 04:35:09,221 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 04:35:09,223 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 04:35:09,224 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 04:35:09,226 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 04:35:09,227 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 04:35:09,230 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 04:35:09,231 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 04:35:09,233 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 04:35:09,234 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 04:35:09,236 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 04:35:09,238 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 04:35:09,239 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 04:35:09,241 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 04:35:09,242 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 04:35:09,244 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 04:35:09,245 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 04:35:09,803 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:09,805 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 04:35:09,822 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 04:35:09,826 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 04:35:09,846 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 04:35:09,848 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 04:35:09,851 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 04:35:09,853 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 04:35:09,855 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 04:35:09,857 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 04:35:10,618 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:10,618 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:10,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:10,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:10,619 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 04:35:10,630 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 04:35:10,630 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 04:35:10,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:10,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:10,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:10,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:10,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:10,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:10,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:10,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:10,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 04:35:10,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:10,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:10,657 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 04:35:10,657 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 04:35:10,659 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 04:35:10,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:10,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:10,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:10,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:10,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:10,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:10,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:10,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 04:35:10,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:10,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:10,691 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 04:35:10,692 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 04:35:10,693 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 04:35:10,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:10,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:10,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:10,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:10,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:10,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:10,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:10,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:10,728 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 04:35:10,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:10,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:10,730 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 04:35:10,730 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 04:35:10,732 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 04:35:10,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:10,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:10,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:10,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:10,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:10,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:10,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:10,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:10,755 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 04:35:10,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:10,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:10,757 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 04:35:10,757 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 04:35:10,759 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 04:35:10,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:10,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:10,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:10,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:10,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:10,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:10,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:10,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:10,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 04:35:10,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:10,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:10,796 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 04:35:10,797 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 04:35:10,839 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 04:35:10,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:10,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:10,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:10,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:10,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:10,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:10,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:10,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:10,862 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 04:35:10,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:10,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:10,864 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 04:35:10,864 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 04:35:10,866 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 04:35:10,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:10,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:10,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:10,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:10,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:10,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:10,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:10,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:10,905 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 04:35:10,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:10,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:10,907 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 04:35:10,908 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 04:35:10,909 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 04:35:10,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:10,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:10,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:10,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:10,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:10,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:10,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:10,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 04:35:10,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:10,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:10,935 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 04:35:10,936 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 04:35:10,937 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 04:35:10,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:10,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:10,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:10,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:10,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:10,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:10,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:10,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:10,961 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 04:35:10,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:10,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:10,963 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 04:35:10,963 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 04:35:10,965 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 04:35:10,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:10,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:10,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:10,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:10,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:10,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:10,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:10,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:10,996 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 04:35:10,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:10,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:10,998 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 04:35:10,999 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 04:35:11,000 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 04:35:11,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:11,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:11,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:11,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:11,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:11,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:11,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:11,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 04:35:11,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:11,026 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 04:35:11,026 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 04:35:11,028 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 04:35:11,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:11,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:11,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:11,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:11,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:11,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:11,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:11,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:11,089 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 04:35:11,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:11,091 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 04:35:11,091 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 04:35:11,092 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 04:35:11,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:11,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:11,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:11,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:11,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:11,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:11,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:11,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 04:35:11,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:11,119 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 04:35:11,121 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 04:35:11,122 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 04:35:11,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:11,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:11,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:11,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:11,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:11,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:11,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:11,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:11,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 04:35:11,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:11,146 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 04:35:11,147 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 04:35:11,149 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 04:35:11,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:11,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:11,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:11,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:11,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:11,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:11,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:11,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:11,173 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 04:35:11,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:11,174 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 04:35:11,175 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 04:35:11,176 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 04:35:11,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:11,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:11,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:11,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:11,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:11,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:11,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:11,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:11,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 04:35:11,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:11,213 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 04:35:11,213 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 04:35:11,215 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 04:35:11,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:11,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:11,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:11,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:11,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:11,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:11,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:11,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:11,243 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 04:35:11,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:11,245 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 04:35:11,246 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 04:35:11,247 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 04:35:11,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:11,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:11,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:11,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:11,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:11,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:11,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:11,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:11,281 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 04:35:11,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:11,283 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 04:35:11,296 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 04:35:11,302 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 04:35:11,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:11,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:11,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:11,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:11,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:11,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:11,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:11,325 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 04:35:11,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:11,326 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 04:35:11,326 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 04:35:11,328 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 04:35:11,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:11,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:11,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:11,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:11,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:11,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:11,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:11,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 04:35:11,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:11,369 INFO L229 MonitoredProcess]: Starting monitored process 43 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 04:35:11,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 04:35:11,372 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 04:35:11,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:11,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:11,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:11,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:11,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:11,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:11,413 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:11,467 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 04:35:11,467 INFO L444 ModelExtractionUtils]: 14 out of 58 variables were initially zero. Simplification set additionally 41 variables to zero. [2022-02-21 04:35:11,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:11,468 INFO L229 MonitoredProcess]: Starting monitored process 44 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 04:35:11,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 04:35:11,470 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:11,491 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:11,492 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:11,492 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3) = -1*ULTIMATE.start_cstrpbrk_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3 Supporting invariants [] [2022-02-21 04:35:11,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:11,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:11,601 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2022-02-21 04:35:11,607 INFO L390 LassoCheck]: Loop: "call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);" "assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1;" "call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1;" "assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1;" "call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);" "assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1;" "cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;" [2022-02-21 04:35:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:11,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:11,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:35:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:11,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:11,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {809#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {809#unseeded} is VALID [2022-02-21 04:35:11,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {809#unseeded} is VALID [2022-02-21 04:35:11,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {809#unseeded} assume !(main_~length1~0#1 < 1); {809#unseeded} is VALID [2022-02-21 04:35:11,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {809#unseeded} assume !(main_~length2~0#1 < 1); {809#unseeded} is VALID [2022-02-21 04:35:11,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {809#unseeded} call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:11,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:11,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:11,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:11,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} main_~i~1#1 := 0; {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:11,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:11,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:11,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} assume !(main_~i~1#1 < main_~length2~0#1 - 1); {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} is VALID [2022-02-21 04:35:11,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {929#(and (= |ULTIMATE.start_main_#t~malloc12#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|) unseeded)} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {908#(and (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) unseeded)} is VALID [2022-02-21 04:35:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:11,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:35:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:11,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:11,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {909#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {954#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} is VALID [2022-02-21 04:35:11,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {954#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; {954#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} is VALID [2022-02-21 04:35:11,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {954#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; {954#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} is VALID [2022-02-21 04:35:11,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {954#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {954#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} is VALID [2022-02-21 04:35:11,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {954#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; {954#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} is VALID [2022-02-21 04:35:11,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {954#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {954#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} is VALID [2022-02-21 04:35:11,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {954#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; {954#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} is VALID [2022-02-21 04:35:11,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {954#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; {911#(and (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|)))) unseeded))} is VALID [2022-02-21 04:35:11,823 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 04:35:11,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 04:35:11,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:11,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 8 letters. [2022-02-21 04:35:11,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,834 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 04:35:11,834 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 04:35:11,888 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 29 states and 36 transitions. Complement of second has 5 states. [2022-02-21 04:35:11,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:11,888 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:11,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:11,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:11,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:11,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 04:35:11,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:11,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:11,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:11,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2022-02-21 04:35:11,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:11,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:11,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:11,889 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 26 transitions. cyclomatic complexity: 8 [2022-02-21 04:35:11,890 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 04:35:11,890 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 04:35:11,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:11,890 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:11,890 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 04:35:11,891 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 04:35:11,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 8 letters. [2022-02-21 04:35:11,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 8 letters. [2022-02-21 04:35:11,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 8 letters. [2022-02-21 04:35:11,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:11,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 2 letters. [2022-02-21 04:35:11,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:11,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:11,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 3 letters. [2022-02-21 04:35:11,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:11,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 29 letters. [2022-02-21 04:35:11,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 29 letters. Loop has 29 letters. [2022-02-21 04:35:11,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 29 letters. Loop has 29 letters. [2022-02-21 04:35:11,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:35:11,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 letters. Loop has 21 letters. [2022-02-21 04:35:11,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 21 letters. Loop has 21 letters. [2022-02-21 04:35:11,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:11,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 04:35:11,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:11,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:35:11,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 8 letters. [2022-02-21 04:35:11,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:35:11,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:11,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 3 letters. [2022-02-21 04:35:11,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:11,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:35:11,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 8 letters. [2022-02-21 04:35:11,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:35:11,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:35:11,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 8 letters. [2022-02-21 04:35:11,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:35:11,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 8 letters. [2022-02-21 04:35:11,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 8 letters. [2022-02-21 04:35:11,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 8 letters. [2022-02-21 04:35:11,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:11,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 3 letters. [2022-02-21 04:35:11,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:11,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:11,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 3 letters. [2022-02-21 04:35:11,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:11,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:35:11,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 20 letters. Loop has 8 letters. [2022-02-21 04:35:11,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:35:11,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:11,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 2 letters. [2022-02-21 04:35:11,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 04:35:11,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:11,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 3 letters. [2022-02-21 04:35:11,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:35:11,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:11,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 3 letters. [2022-02-21 04:35:11,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:35:11,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:11,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 3 letters. [2022-02-21 04:35:11,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:35:11,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,897 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 04:35:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-21 04:35:11,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 8 letters. [2022-02-21 04:35:11,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:35:11,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 16 letters. [2022-02-21 04:35:11,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:11,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. cyclomatic complexity: 11 [2022-02-21 04:35:11,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:11,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 33 transitions. [2022-02-21 04:35:11,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 04:35:11,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 04:35:11,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2022-02-21 04:35:11,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:35:11,900 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-21 04:35:11,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2022-02-21 04:35:11,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-21 04:35:11,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:11,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 33 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 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 04:35:11,901 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 33 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 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 04:35:11,901 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 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 04:35:11,901 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:11,903 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-02-21 04:35:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-21 04:35:11,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:11,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:11,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 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 26 states and 33 transitions. [2022-02-21 04:35:11,903 INFO L87 Difference]: Start difference. First operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 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 26 states and 33 transitions. [2022-02-21 04:35:11,903 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:35:11,904 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-02-21 04:35:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-21 04:35:11,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:11,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:11,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:11,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 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 04:35:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-02-21 04:35:11,905 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-21 04:35:11,905 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-21 04:35:11,905 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:35:11,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2022-02-21 04:35:11,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:35:11,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:11,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:11,905 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:11,905 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:35:11,905 INFO L791 eck$LassoCheckResult]: Stem: 1016#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1017#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~nondet15#1, main_#t~post14#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post16#1, main_~i~1#1, main_#t~ret18#1.base, main_#t~ret18#1.offset, 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~nondet10#1;havoc main_#t~nondet10#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1025#L532 assume !(main_~length1~0#1 < 1); 1018#L532-2 assume !(main_~length2~0#1 < 1); 1014#L535-1 call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;main_~i~0#1 := 0; 1015#L541-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1; 1034#L541-2 main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1035#L541-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1026#L541-4 main_~i~1#1 := 0; 1021#L546-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);call write~int(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1; 1022#L546-2 main_#t~post16#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1023#L546-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1024#L546-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 1027#L519-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 1037#L519-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 1029#L522-5 [2022-02-21 04:35:11,905 INFO L793 eck$LassoCheckResult]: Loop: 1029#L522-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 1038#L522-1 assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 1028#L522-3 assume !!cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1;cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post8#1.base, 1 + cstrpbrk_#t~post8#1.offset;havoc cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset; 1029#L522-5 [2022-02-21 04:35:11,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:11,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2022-02-21 04:35:11,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:11,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11148348] [2022-02-21 04:35:11,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:11,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:11,920 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:11,928 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:11,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:11,928 INFO L85 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2022-02-21 04:35:11,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:11,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728720991] [2022-02-21 04:35:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:11,933 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:11,935 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:11,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2022-02-21 04:35:11,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:11,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548028322] [2022-02-21 04:35:11,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:11,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:11,951 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:11,961 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:13,161 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:13,161 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:13,161 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:13,161 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:13,161 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:13,161 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:13,161 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:13,161 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:13,162 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration7_Lasso [2022-02-21 04:35:13,162 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:13,162 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:13,164 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 04:35:13,166 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 04:35:13,168 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 04:35:13,169 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 04:35:13,171 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 04:35:13,172 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 04:35:13,177 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 04:35:13,179 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 04:35:13,181 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 04:35:13,182 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 04:35:13,184 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 04:35:13,185 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 04:35:13,187 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 04:35:13,188 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 04:35:13,203 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 04:35:13,205 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 04:35:13,206 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 04:35:13,208 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 04:35:13,209 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 04:35:13,211 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 04:35:13,214 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 04:35:13,215 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 04:35:13,859 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString1~0#1.base) (+ ULTIMATE.start_main_~i~0#1 ULTIMATE.start_main_~nondetString1~0#1.offset (- 1)))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 04:35:13,862 INFO L158 Benchmark]: Toolchain (without parser) took 11503.65ms. Allocated memory was 98.6MB in the beginning and 174.1MB in the end (delta: 75.5MB). Free memory was 66.5MB in the beginning and 100.9MB in the end (delta: -34.5MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2022-02-21 04:35:13,862 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory was 52.3MB in the beginning and 52.2MB in the end (delta: 100.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:13,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.86ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 66.2MB in the beginning and 86.8MB in the end (delta: -20.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:13,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.25ms. Allocated memory is still 119.5MB. Free memory was 86.8MB in the beginning and 84.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:13,863 INFO L158 Benchmark]: Boogie Preprocessor took 35.63ms. Allocated memory is still 119.5MB. Free memory was 84.6MB in the beginning and 83.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:13,863 INFO L158 Benchmark]: RCFGBuilder took 359.45ms. Allocated memory is still 119.5MB. Free memory was 83.0MB in the beginning and 68.2MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 04:35:13,863 INFO L158 Benchmark]: BuchiAutomizer took 10696.69ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 68.2MB in the beginning and 100.9MB in the end (delta: -32.8MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2022-02-21 04:35:13,865 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.20ms. Allocated memory is still 98.6MB. Free memory was 52.3MB in the beginning and 52.2MB in the end (delta: 100.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.86ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 66.2MB in the beginning and 86.8MB in the end (delta: -20.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.25ms. Allocated memory is still 119.5MB. Free memory was 86.8MB in the beginning and 84.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.63ms. Allocated memory is still 119.5MB. Free memory was 84.6MB in the beginning and 83.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.45ms. Allocated memory is still 119.5MB. Free memory was 83.0MB in the beginning and 68.2MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 10696.69ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 68.2MB in the beginning and 100.9MB in the end (delta: -32.8MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString1~0#1.base) (+ ULTIMATE.start_main_~i~0#1 ULTIMATE.start_main_~nondetString1~0#1.offset (- 1)))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString1~0#1.base) (+ ULTIMATE.start_main_~i~0#1 ULTIMATE.start_main_~nondetString1~0#1.offset (- 1)))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 04:35:13,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString1~0#1.base) (+ ULTIMATE.start_main_~i~0#1 ULTIMATE.start_main_~nondetString1~0#1.offset (- 1)))_1 was not added to the transformula!