./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.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-examples/data_structures_set_multi_proc_trivial_ground.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 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:36:19,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:36:19,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:36:19,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:36:19,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:36:19,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:36:19,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:36:19,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:36:19,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:36:19,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:36:19,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:36:19,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:36:19,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:36:19,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:36:19,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:36:19,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:36:19,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:36:19,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:36:19,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:36:19,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:36:19,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:36:19,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:36:19,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:36:19,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:36:19,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:36:19,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:36:19,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:36:19,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:36:19,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:36:19,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:36:19,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:36:19,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:36:19,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:36:19,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:36:19,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:36:19,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:36:19,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:36:19,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:36:19,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:36:19,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:36:19,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:36:19,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:36:19,405 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:36:19,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:36:19,406 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:36:19,406 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:36:19,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:36:19,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:36:19,408 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:36:19,409 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:36:19,409 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:36:19,409 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:36:19,410 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:36:19,410 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:36:19,410 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:36:19,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:36:19,411 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:36:19,411 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:36:19,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:36:19,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:36:19,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:36:19,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:36:19,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:36:19,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:36:19,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:36:19,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:36:19,414 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:36:19,414 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:36:19,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:36:19,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:36:19,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:36:19,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:36:19,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:36:19,416 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:36:19,416 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 -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2022-02-21 03:36:19,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:36:19,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:36:19,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:36:19,674 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:36:19,675 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:36:19,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2022-02-21 03:36:19,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c148444/b4d79fa2478b406ab8aacf59d0e25221/FLAG8e904f74c [2022-02-21 03:36:20,085 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:36:20,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2022-02-21 03:36:20,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c148444/b4d79fa2478b406ab8aacf59d0e25221/FLAG8e904f74c [2022-02-21 03:36:20,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c148444/b4d79fa2478b406ab8aacf59d0e25221 [2022-02-21 03:36:20,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:36:20,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:36:20,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:20,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:36:20,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:36:20,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:20" (1/1) ... [2022-02-21 03:36:20,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8e968c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:20, skipping insertion in model container [2022-02-21 03:36:20,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:20" (1/1) ... [2022-02-21 03:36:20,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:36:20,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:36:20,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2022-02-21 03:36:20,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:20,289 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:36:20,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2022-02-21 03:36:20,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:20,316 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:36:20,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:20 WrapperNode [2022-02-21 03:36:20,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:20,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:20,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:36:20,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:36:20,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:20" (1/1) ... [2022-02-21 03:36:20,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:20" (1/1) ... [2022-02-21 03:36:20,360 INFO L137 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 169 [2022-02-21 03:36:20,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:20,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:36:20,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:36:20,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:36:20,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:20" (1/1) ... [2022-02-21 03:36:20,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:20" (1/1) ... [2022-02-21 03:36:20,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:20" (1/1) ... [2022-02-21 03:36:20,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:20" (1/1) ... [2022-02-21 03:36:20,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:20" (1/1) ... [2022-02-21 03:36:20,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:20" (1/1) ... [2022-02-21 03:36:20,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:20" (1/1) ... [2022-02-21 03:36:20,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:36:20,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:36:20,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:36:20,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:36:20,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:20" (1/1) ... [2022-02-21 03:36:20,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:20,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:20,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:20,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:36:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:36:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:36:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:36:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:36:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:36:20,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:36:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:36:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:36:20,510 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:36:20,511 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:36:20,879 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:36:20,902 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:36:20,907 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-21 03:36:20,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:20 BoogieIcfgContainer [2022-02-21 03:36:20,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:36:20,910 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:36:20,911 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:36:20,913 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:36:20,914 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:20,914 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:36:20" (1/3) ... [2022-02-21 03:36:20,915 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d37341e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:20, skipping insertion in model container [2022-02-21 03:36:20,915 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:20,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:20" (2/3) ... [2022-02-21 03:36:20,916 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d37341e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:20, skipping insertion in model container [2022-02-21 03:36:20,916 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:20,916 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:20" (3/3) ... [2022-02-21 03:36:20,917 INFO L388 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2022-02-21 03:36:20,961 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:36:20,961 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:36:20,961 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:36:20,961 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:36:20,961 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:36:20,962 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:36:20,962 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:36:20,962 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:36:20,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:21,011 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2022-02-21 03:36:21,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:21,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:21,016 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:21,017 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:21,017 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:36:21,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:21,022 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2022-02-21 03:36:21,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:21,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:21,022 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:21,022 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:21,027 INFO L791 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 45#L33-3true [2022-02-21 03:36:21,027 INFO L793 eck$LassoCheckResult]: Loop: 45#L33-3true assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 35#L33-2true main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 45#L33-3true [2022-02-21 03:36:21,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:21,031 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:36:21,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:21,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149411337] [2022-02-21 03:36:21,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:21,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:21,141 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:21,182 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-02-21 03:36:21,185 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:21,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938118450] [2022-02-21 03:36:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:21,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:21,214 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:21,228 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:21,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:21,230 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 03:36:21,231 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:21,231 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6420277] [2022-02-21 03:36:21,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:21,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:21,272 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:21,286 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:21,563 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:21,564 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:21,564 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:21,564 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:21,564 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:21,564 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:21,565 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:21,565 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:21,565 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration1_Lasso [2022-02-21 03:36:21,565 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:21,565 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:21,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,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 03:36:21,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:21,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 03:36:22,313 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:22,315 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:22,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:22,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:22,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:22,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:22,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:22,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:22,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:22,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:22,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:22,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:22,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:22,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:36:22,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:22,375 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 03:36:22,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:22,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:22,379 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:22,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:36:22,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:22,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:22,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:22,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:22,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:22,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:22,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:22,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:22,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:36:22,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:22,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:22,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:22,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:36:22,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:22,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:22,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:22,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:22,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:22,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:22,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:22,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:22,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:36:22,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:22,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:22,478 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:22,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:36:22,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:22,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:22,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:22,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:22,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:22,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:22,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:22,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:22,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:22,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:22,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:22,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:22,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:22,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:22,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:22,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:22,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:22,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:36:22,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:22,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:22,586 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:22,634 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 03:36:22,635 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:36:22,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:22,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:22,637 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:22,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:36:22,639 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:22,654 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:22,654 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:22,655 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1) = -8*ULTIMATE.start_main_~x~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1 Supporting invariants [] [2022-02-21 03:36:22,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:22,704 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-02-21 03:36:22,709 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1;" "main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1;" [2022-02-21 03:36:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:22,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:22,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:22,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:22,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {55#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {55#unseeded} is VALID [2022-02-21 03:36:22,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {55#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {55#unseeded} is VALID [2022-02-21 03:36:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:22,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:36:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:22,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:22,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(>= oldRank0 (+ (* (- 8) |ULTIMATE.start_main_~x~0#1|) (* 199999 (select |#length| |ULTIMATE.start_main_~#set~0#1.base|))))} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {101#(and (>= oldRank0 (+ (* (select |#length| |ULTIMATE.start_main_~#set~0#1.base|) 199999) (* |ULTIMATE.start_main_~x~0#1| (- 8)))) (<= 4 (select |#length| |ULTIMATE.start_main_~#set~0#1.base|)) (< |ULTIMATE.start_main_~x~0#1| 100000))} is VALID [2022-02-21 03:36:22,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#(and (>= oldRank0 (+ (* (select |#length| |ULTIMATE.start_main_~#set~0#1.base|) 199999) (* |ULTIMATE.start_main_~x~0#1| (- 8)))) (<= 4 (select |#length| |ULTIMATE.start_main_~#set~0#1.base|)) (< |ULTIMATE.start_main_~x~0#1| 100000))} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {93#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 8) |ULTIMATE.start_main_~x~0#1|) (* 199999 (select |#length| |ULTIMATE.start_main_~#set~0#1.base|))))))} is VALID [2022-02-21 03:36:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:22,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:22,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:22,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:22,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,889 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:36:22,891 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:22,958 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 89 states and 139 transitions. Complement of second has 8 states. [2022-02-21 03:36:22,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:22,958 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:22,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:22,961 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2022-02-21 03:36:22,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:22,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:22,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:22,965 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:36:22,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:22,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:22,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 139 transitions. [2022-02-21 03:36:22,968 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 33 [2022-02-21 03:36:22,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:22,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:22,970 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:22,974 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2022-02-21 03:36:22,982 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 35 examples of accepted words. [2022-02-21 03:36:22,985 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:22,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:36:22,989 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:36:22,991 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 89 states and 139 transitions. cyclomatic complexity: 59 [2022-02-21 03:36:22,998 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 33 examples of accepted words. [2022-02-21 03:36:22,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:22,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:23,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:23,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:23,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:23,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:23,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 89 letters. Loop has 89 letters. [2022-02-21 03:36:23,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 89 letters. Loop has 89 letters. [2022-02-21 03:36:23,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 89 letters. Loop has 89 letters. [2022-02-21 03:36:23,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 45 letters. Loop has 45 letters. [2022-02-21 03:36:23,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 45 letters. Loop has 45 letters. [2022-02-21 03:36:23,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:23,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:23,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:23,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:23,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:36:23,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:36:23,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:36:23,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:36:23,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:36:23,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:23,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:23,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:36:23,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:23,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:36:23,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 8 letters. [2022-02-21 03:36:23,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 8 letters. [2022-02-21 03:36:23,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:36:23,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 8 letters. [2022-02-21 03:36:23,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 8 letters. [2022-02-21 03:36:23,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:36:23,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:36:23,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:36:23,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:36:23,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:36:23,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:36:23,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:23,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 9 letters. [2022-02-21 03:36:23,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 9 letters. [2022-02-21 03:36:23,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:36:23,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:36:23,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 8 letters. [2022-02-21 03:36:23,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 8 letters. [2022-02-21 03:36:23,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:23,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:23,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:23,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:36:23,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:36:23,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:36:23,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:36:23,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:36:23,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:36:23,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:36:23,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:36:23,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:23,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:23,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:23,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:36:23,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:23,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:36:23,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:36:23,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:23,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:23,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:36:23,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:36:23,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:23,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. Loop has 2 letters. [2022-02-21 03:36:23,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. Loop has 2 letters. [2022-02-21 03:36:23,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:36:23,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:23,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:36:23,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:36:23,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:36:23,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:23,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:23,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:23,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:36:23,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:36:23,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:36:23,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:23,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:36:23,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:23,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:36:23,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:23,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:36:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:36:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 8 letters. [2022-02-21 03:36:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 8 letters. [2022-02-21 03:36:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:36:23,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:36:23,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:36:23,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:36:23,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:36:23,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:36:23,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 8 letters. [2022-02-21 03:36:23,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 8 letters. [2022-02-21 03:36:23,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:36:23,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:36:23,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 8 letters. [2022-02-21 03:36:23,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 8 letters. [2022-02-21 03:36:23,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:23,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 9 letters. [2022-02-21 03:36:23,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 9 letters. [2022-02-21 03:36:23,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:36:23,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:36:23,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:23,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:23,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:36:23,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:36:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 03:36:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:36:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:36:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:23,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:23,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:23,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:36:23,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:36:23,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:36:23,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:23,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:36:23,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:36:23,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:23,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:36:23,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:36:23,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:23,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:36:23,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:36:23,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 3 letters. [2022-02-21 03:36:23,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 89 states and 139 transitions. cyclomatic complexity: 59 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:23,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,091 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-02-21 03:36:23,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:23,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:36:23,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:36:23,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 139 transitions. cyclomatic complexity: 59 [2022-02-21 03:36:23,100 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 33 [2022-02-21 03:36:23,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 42 states and 65 transitions. [2022-02-21 03:36:23,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-02-21 03:36:23,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2022-02-21 03:36:23,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 65 transitions. [2022-02-21 03:36:23,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:23,105 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 65 transitions. [2022-02-21 03:36:23,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 65 transitions. [2022-02-21 03:36:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-21 03:36:23,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:23,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states and 65 transitions. Second operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:23,126 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states and 65 transitions. Second operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:23,129 INFO L87 Difference]: Start difference. First operand 42 states and 65 transitions. Second operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:23,133 INFO L93 Difference]: Finished difference Result 42 states and 65 transitions. [2022-02-21 03:36:23,133 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2022-02-21 03:36:23,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:23,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:23,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 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 42 states and 65 transitions. [2022-02-21 03:36:23,135 INFO L87 Difference]: Start difference. First operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 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 42 states and 65 transitions. [2022-02-21 03:36:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:23,137 INFO L93 Difference]: Finished difference Result 42 states and 65 transitions. [2022-02-21 03:36:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2022-02-21 03:36:23,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:23,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:23,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:23,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 65 transitions. [2022-02-21 03:36:23,140 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 65 transitions. [2022-02-21 03:36:23,140 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 65 transitions. [2022-02-21 03:36:23,140 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:36:23,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 65 transitions. [2022-02-21 03:36:23,141 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 33 [2022-02-21 03:36:23,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:23,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:23,142 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:36:23,142 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:23,142 INFO L791 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 218#L33-3 assume !(main_~x~0#1 < 100000); 211#L33-4 main_~x~0#1 := 0; 212#L39-3 [2022-02-21 03:36:23,143 INFO L793 eck$LassoCheckResult]: Loop: 212#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 224#L40-3 assume !true; 226#L39-2 main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 212#L39-3 [2022-02-21 03:36:23,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:23,143 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-02-21 03:36:23,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:23,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141790625] [2022-02-21 03:36:23,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:23,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {334#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {334#true} is VALID [2022-02-21 03:36:23,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {336#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:23,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {336#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !(main_~x~0#1 < 100000); {335#false} is VALID [2022-02-21 03:36:23,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {335#false} main_~x~0#1 := 0; {335#false} is VALID [2022-02-21 03:36:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:23,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:23,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141790625] [2022-02-21 03:36:23,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141790625] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:23,202 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:23,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:36:23,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839712565] [2022-02-21 03:36:23,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:23,204 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:23,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:23,205 INFO L85 PathProgramCache]: Analyzing trace with hash 54297, now seen corresponding path program 1 times [2022-02-21 03:36:23,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:23,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538537596] [2022-02-21 03:36:23,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {337#true} is VALID [2022-02-21 03:36:23,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume !true; {338#false} is VALID [2022-02-21 03:36:23,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {338#false} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {338#false} is VALID [2022-02-21 03:36:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:23,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:23,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538537596] [2022-02-21 03:36:23,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538537596] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:23,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:23,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:36:23,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652797228] [2022-02-21 03:36:23,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:23,213 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:36:23,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:23,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:36:23,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:36:23,216 INFO L87 Difference]: Start difference. First operand 42 states and 65 transitions. cyclomatic complexity: 28 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:23,256 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-02-21 03:36:23,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:36:23,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:23,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:23,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2022-02-21 03:36:23,261 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2022-02-21 03:36:23,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 39 states and 51 transitions. [2022-02-21 03:36:23,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-02-21 03:36:23,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-02-21 03:36:23,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2022-02-21 03:36:23,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:23,263 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-02-21 03:36:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2022-02-21 03:36:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-21 03:36:23,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:23,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states and 51 transitions. Second operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:23,266 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states and 51 transitions. Second operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:23,266 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:23,267 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-02-21 03:36:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-02-21 03:36:23,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:23,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:23,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 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 39 states and 51 transitions. [2022-02-21 03:36:23,273 INFO L87 Difference]: Start difference. First operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 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 39 states and 51 transitions. [2022-02-21 03:36:23,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:23,277 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-02-21 03:36:23,277 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-02-21 03:36:23,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:23,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:23,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:23,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-02-21 03:36:23,279 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-02-21 03:36:23,279 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-02-21 03:36:23,279 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:36:23,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2022-02-21 03:36:23,280 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2022-02-21 03:36:23,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:23,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:23,281 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:36:23,281 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:23,281 INFO L791 eck$LassoCheckResult]: Stem: 414#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 389#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 390#L33-3 assume !(main_~x~0#1 < 100000); 385#L33-4 main_~x~0#1 := 0; 386#L39-3 [2022-02-21 03:36:23,281 INFO L793 eck$LassoCheckResult]: Loop: 386#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 397#L40-3 assume !(main_~y~0#1 < main_~n~0#1); 399#L39-2 main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 386#L39-3 [2022-02-21 03:36:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 2 times [2022-02-21 03:36:23,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:23,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567808271] [2022-02-21 03:36:23,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:23,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {501#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {501#true} is VALID [2022-02-21 03:36:23,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {503#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:23,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {503#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !(main_~x~0#1 < 100000); {502#false} is VALID [2022-02-21 03:36:23,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {502#false} main_~x~0#1 := 0; {502#false} is VALID [2022-02-21 03:36:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:23,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:23,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567808271] [2022-02-21 03:36:23,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567808271] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:23,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:23,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:36:23,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734909739] [2022-02-21 03:36:23,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:23,302 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:23,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:23,302 INFO L85 PathProgramCache]: Analyzing trace with hash 53832, now seen corresponding path program 1 times [2022-02-21 03:36:23,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:23,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124131466] [2022-02-21 03:36:23,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:23,307 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:23,309 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:23,329 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:23,329 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:23,329 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:23,329 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:23,330 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:36:23,330 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:23,330 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:23,330 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:23,330 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2022-02-21 03:36:23,330 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:23,330 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:23,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:23,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:23,374 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:23,375 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:36:23,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:23,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:23,408 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:23,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:36:23,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:36:23,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:36:23,433 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:36:23,433 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:36:23,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:23,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:23,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:23,465 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:23,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:36:23,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:36:23,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:36:23,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:23,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:23,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:23,507 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:23,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:36:23,509 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:36:23,509 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:36:23,688 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:36:23,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:23,691 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:23,691 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:23,691 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:23,691 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:23,691 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:23,691 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:23,691 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:23,691 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:23,691 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2022-02-21 03:36:23,691 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:23,691 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:23,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:23,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:23,739 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:23,739 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:23,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:23,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:23,741 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:23,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:36:23,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:23,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:23,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:23,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:23,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:23,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:23,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:23,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:23,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:23,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 03:36:23,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:23,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:23,776 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:23,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:36:23,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:23,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:23,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:23,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:23,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:23,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:23,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:23,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:23,800 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:23,804 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:36:23,804 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:36:23,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:23,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:23,806 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:23,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:36:23,835 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:23,836 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:36:23,836 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:23,836 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2022-02-21 03:36:23,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:23,859 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:36:23,863 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1;" "assume !(main_~y~0#1 < main_~n~0#1);" "main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2022-02-21 03:36:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:23,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {506#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {506#unseeded} is VALID [2022-02-21 03:36:23,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {506#unseeded} is VALID [2022-02-21 03:36:23,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#unseeded} assume !(main_~x~0#1 < 100000); {506#unseeded} is VALID [2022-02-21 03:36:23,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {506#unseeded} main_~x~0#1 := 0; {506#unseeded} is VALID [2022-02-21 03:36:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,909 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:36:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:23,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:23,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {509#(>= oldRank0 (+ |ULTIMATE.start_main_~n~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {533#(and (< |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~n~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:36:23,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {533#(and (< |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~n~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume !(main_~y~0#1 < main_~n~0#1); {533#(and (< |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~n~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:36:23,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {533#(and (< |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ |ULTIMATE.start_main_~n~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {519#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~n~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)))) unseeded)} is VALID [2022-02-21 03:36:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:23,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:23,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:23,953 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 4 letters. Loop has 3 letters. [2022-02-21 03:36:23,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,954 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:36:23,954 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,058 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 17. 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 70 states and 94 transitions. Complement of second has 7 states. [2022-02-21 03:36:24,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:24,059 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:24,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. cyclomatic complexity: 17 [2022-02-21 03:36:24,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:24,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:24,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:24,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:24,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:24,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 94 transitions. [2022-02-21 03:36:24,061 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 31 [2022-02-21 03:36:24,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:24,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:24,061 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 51 transitions. cyclomatic complexity: 17 [2022-02-21 03:36:24,063 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 30 examples of accepted words. [2022-02-21 03:36:24,063 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:24,064 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:24,065 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 70 states and 94 transitions. cyclomatic complexity: 33 [2022-02-21 03:36:24,066 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 31 examples of accepted words. [2022-02-21 03:36:24,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:24,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,067 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 4 letters. Loop has 3 letters. [2022-02-21 03:36:24,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:24,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:24,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:24,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:24,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:24,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:24,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:24,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 70 letters. Loop has 70 letters. [2022-02-21 03:36:24,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,069 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 70 letters. Loop has 70 letters. [2022-02-21 03:36:24,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 70 letters. Loop has 70 letters. [2022-02-21 03:36:24,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:36:24,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,069 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 39 letters. Loop has 39 letters. [2022-02-21 03:36:24,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:36:24,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:36:24,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,070 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 4 letters. Loop has 4 letters. [2022-02-21 03:36:24,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:36:24,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:36:24,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,070 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 4 letters. [2022-02-21 03:36:24,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:36:24,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:36:24,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,071 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 4 letters. [2022-02-21 03:36:24,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:36:24,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:24,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,072 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 03:36:24,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:24,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:24,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,072 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 3 letters. [2022-02-21 03:36:24,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:24,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:24,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,073 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 03:36:24,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:24,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:36:24,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,073 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 4 letters. [2022-02-21 03:36:24,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:36:24,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:36:24,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,094 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 3 letters. [2022-02-21 03:36:24,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:36:24,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:36:24,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,095 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 9 letters. [2022-02-21 03:36:24,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:36:24,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:24,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,095 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 03:36:24,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:24,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:24,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,096 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 3 letters. [2022-02-21 03:36:24,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:24,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:36:24,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,096 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 17 letters. Loop has 4 letters. [2022-02-21 03:36:24,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:36:24,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:36:24,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,096 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 18 letters. Loop has 4 letters. [2022-02-21 03:36:24,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:36:24,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:36:24,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,096 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 3 letters. [2022-02-21 03:36:24,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:36:24,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:36:24,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,097 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 4 letters. [2022-02-21 03:36:24,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:36:24,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:24,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,097 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 3 letters. [2022-02-21 03:36:24,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:24,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:36:24,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,097 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 8 letters. [2022-02-21 03:36:24,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:36:24,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:36:24,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,098 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 03:36:24,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:36:24,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:36:24,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,098 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 8 letters. [2022-02-21 03:36:24,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:36:24,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:24,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,098 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 8 letters. [2022-02-21 03:36:24,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:24,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:36:24,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,099 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 3 letters. [2022-02-21 03:36:24,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:36:24,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:36:24,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,100 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 03:36:24,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:36:24,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:36:24,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,100 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 8 letters. [2022-02-21 03:36:24,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:36:24,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:24,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:24,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:24,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:36:24,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:36:24,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:36:24,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:24,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,102 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 4 letters. Loop has 3 letters. [2022-02-21 03:36:24,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:24,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:36:24,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,103 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 4 letters. [2022-02-21 03:36:24,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:36:24,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:36:24,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,103 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 4 letters. [2022-02-21 03:36:24,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:36:24,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:24,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,104 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 3 letters. [2022-02-21 03:36:24,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:24,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:36:24,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,104 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 4 letters. [2022-02-21 03:36:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:36:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,105 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 3 letters. [2022-02-21 03:36:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:24,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:24,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:24,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:24,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:36:24,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,120 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 4 letters. [2022-02-21 03:36:24,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:36:24,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:36:24,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,120 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 4 letters. [2022-02-21 03:36:24,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:36:24,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:36:24,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,121 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 4 letters. [2022-02-21 03:36:24,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:36:24,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:36:24,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,122 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 4 letters. [2022-02-21 03:36:24,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:36:24,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:24,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,123 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 03:36:24,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:36:24,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:36:24,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,123 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 4 letters. [2022-02-21 03:36:24,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:36:24,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:36:24,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,124 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 4 letters. [2022-02-21 03:36:24,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:36:24,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:24,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,125 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 3 letters. [2022-02-21 03:36:24,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:24,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:36:24,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,126 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 4 letters. [2022-02-21 03:36:24,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:36:24,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:24,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,126 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 03:36:24,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:24,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:36:24,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,127 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 3 letters. [2022-02-21 03:36:24,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:36:24,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:36:24,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,128 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 4 letters. [2022-02-21 03:36:24,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:36:24,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:36:24,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,128 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 17 letters. Loop has 3 letters. [2022-02-21 03:36:24,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:36:24,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:36:24,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,129 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 17 letters. Loop has 4 letters. [2022-02-21 03:36:24,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:36:24,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:36:24,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,130 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 18 letters. Loop has 3 letters. [2022-02-21 03:36:24,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:36:24,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:36:24,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,131 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 18 letters. Loop has 8 letters. [2022-02-21 03:36:24,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 8 letters. [2022-02-21 03:36:24,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:36:24,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,131 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 18 letters. Loop has 4 letters. [2022-02-21 03:36:24,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:36:24,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:36:24,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,132 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 19 letters. Loop has 8 letters. [2022-02-21 03:36:24,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:36:24,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:36:24,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,133 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 19 letters. Loop has 3 letters. [2022-02-21 03:36:24,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:36:24,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 8 letters. [2022-02-21 03:36:24,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,134 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 20 letters. Loop has 8 letters. [2022-02-21 03:36:24,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 8 letters. [2022-02-21 03:36:24,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 9 letters. [2022-02-21 03:36:24,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,134 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 21 letters. Loop has 9 letters. [2022-02-21 03:36:24,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 21 letters. Loop has 9 letters. [2022-02-21 03:36:24,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 8 letters. [2022-02-21 03:36:24,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,135 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 03:36:24,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 8 letters. [2022-02-21 03:36:24,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:36:24,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,136 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 3 letters. [2022-02-21 03:36:24,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:36:24,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:36:24,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,136 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 03:36:24,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 8 letters. [2022-02-21 03:36:24,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:36:24,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,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 15 letters. Loop has 3 letters. [2022-02-21 03:36:24,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:36:24,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:36:24,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,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 16 letters. Loop has 8 letters. [2022-02-21 03:36:24,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:36:24,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:24,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,139 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 03:36:24,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:36:24,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:24,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,139 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 3 letters. [2022-02-21 03:36:24,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:24,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:24,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,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 10 letters. Loop has 3 letters. [2022-02-21 03:36:24,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:24,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:24,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:24,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:36:24,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:36:24,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,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 7 letters. Loop has 2 letters. [2022-02-21 03:36:24,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 94 transitions. cyclomatic complexity: 33 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:36:24,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,142 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-21 03:36:24,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:24,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:24,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:36:24,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:24,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 94 transitions. cyclomatic complexity: 33 [2022-02-21 03:36:24,146 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 31 [2022-02-21 03:36:24,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 55 states and 74 transitions. [2022-02-21 03:36:24,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-02-21 03:36:24,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-02-21 03:36:24,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 74 transitions. [2022-02-21 03:36:24,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:24,148 INFO L681 BuchiCegarLoop]: Abstraction has 55 states and 74 transitions. [2022-02-21 03:36:24,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 74 transitions. [2022-02-21 03:36:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2022-02-21 03:36:24,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:24,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states and 74 transitions. Second operand has 44 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,151 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states and 74 transitions. Second operand has 44 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,151 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 44 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,152 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:24,154 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2022-02-21 03:36:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-02-21 03:36:24,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:24,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:24,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 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 55 states and 74 transitions. [2022-02-21 03:36:24,155 INFO L87 Difference]: Start difference. First operand has 44 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 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 55 states and 74 transitions. [2022-02-21 03:36:24,156 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:24,158 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2022-02-21 03:36:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-02-21 03:36:24,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:24,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:24,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:24,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-02-21 03:36:24,160 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-02-21 03:36:24,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:24,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:36:24,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:36:24,161 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:24,262 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2022-02-21 03:36:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:36:24,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:24,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 104 transitions. [2022-02-21 03:36:24,266 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2022-02-21 03:36:24,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 104 transitions. [2022-02-21 03:36:24,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-02-21 03:36:24,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2022-02-21 03:36:24,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 104 transitions. [2022-02-21 03:36:24,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:24,268 INFO L681 BuchiCegarLoop]: Abstraction has 81 states and 104 transitions. [2022-02-21 03:36:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 104 transitions. [2022-02-21 03:36:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 44. [2022-02-21 03:36:24,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:24,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states and 104 transitions. Second operand has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,270 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states and 104 transitions. Second operand has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,270 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,270 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:24,272 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2022-02-21 03:36:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2022-02-21 03:36:24,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:24,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:24,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 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 81 states and 104 transitions. [2022-02-21 03:36:24,273 INFO L87 Difference]: Start difference. First operand has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 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 81 states and 104 transitions. [2022-02-21 03:36:24,273 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:24,275 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2022-02-21 03:36:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2022-02-21 03:36:24,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:24,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:24,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:24,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-02-21 03:36:24,276 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-02-21 03:36:24,276 INFO L587 BuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-02-21 03:36:24,276 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:36:24,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 58 transitions. [2022-02-21 03:36:24,276 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2022-02-21 03:36:24,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:24,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:24,276 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:24,276 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:36:24,277 INFO L791 eck$LassoCheckResult]: Stem: 1007#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 981#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 982#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1010#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1011#L33-3 assume !(main_~x~0#1 < 100000); 977#L33-4 main_~x~0#1 := 0; 978#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 987#L40-3 [2022-02-21 03:36:24,277 INFO L793 eck$LassoCheckResult]: Loop: 987#L40-3 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 988#L13 assume !(0 == __VERIFIER_assert_~cond#1); 973#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;havoc main_#t~mem8#1; 974#L40-2 main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 987#L40-3 [2022-02-21 03:36:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:24,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669547, now seen corresponding path program 1 times [2022-02-21 03:36:24,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:24,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031621040] [2022-02-21 03:36:24,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:24,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:24,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {1313#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {1313#true} is VALID [2022-02-21 03:36:24,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {1313#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {1315#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:24,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1315#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:24,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {1315#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1316#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:24,318 INFO L290 TraceCheckUtils]: 4: Hoare triple {1316#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !(main_~x~0#1 < 100000); {1314#false} is VALID [2022-02-21 03:36:24,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {1314#false} main_~x~0#1 := 0; {1314#false} is VALID [2022-02-21 03:36:24,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {1314#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {1314#false} is VALID [2022-02-21 03:36:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:24,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:24,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031621040] [2022-02-21 03:36:24,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031621040] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:24,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786363264] [2022-02-21 03:36:24,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:24,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:24,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:24,321 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:24,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 03:36:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:24,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:36:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:24,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:24,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {1313#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {1313#true} is VALID [2022-02-21 03:36:24,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {1313#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {1323#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:24,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {1323#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1323#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:24,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {1323#(<= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1316#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:24,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {1316#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !(main_~x~0#1 < 100000); {1314#false} is VALID [2022-02-21 03:36:24,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {1314#false} main_~x~0#1 := 0; {1314#false} is VALID [2022-02-21 03:36:24,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {1314#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {1314#false} is VALID [2022-02-21 03:36:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:24,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:24,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {1314#false} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {1314#false} is VALID [2022-02-21 03:36:24,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {1314#false} main_~x~0#1 := 0; {1314#false} is VALID [2022-02-21 03:36:24,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {1345#(< |ULTIMATE.start_main_~x~0#1| 100000)} assume !(main_~x~0#1 < 100000); {1314#false} is VALID [2022-02-21 03:36:24,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {1349#(< |ULTIMATE.start_main_~x~0#1| 99999)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {1345#(< |ULTIMATE.start_main_~x~0#1| 100000)} is VALID [2022-02-21 03:36:24,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {1349#(< |ULTIMATE.start_main_~x~0#1| 99999)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {1349#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-21 03:36:24,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {1313#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {1349#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-21 03:36:24,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {1313#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {1313#true} is VALID [2022-02-21 03:36:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:24,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786363264] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:24,436 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:24,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:36:24,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81299935] [2022-02-21 03:36:24,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:24,437 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:24,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1915626, now seen corresponding path program 1 times [2022-02-21 03:36:24,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:24,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465482740] [2022-02-21 03:36:24,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:24,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:24,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:24,451 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:24,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:24,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:36:24,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:36:24,528 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. cyclomatic complexity: 20 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:24,888 INFO L93 Difference]: Finished difference Result 197 states and 253 transitions. [2022-02-21 03:36:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:36:24,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:24,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 253 transitions. [2022-02-21 03:36:24,904 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 132 [2022-02-21 03:36:24,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 197 states and 253 transitions. [2022-02-21 03:36:24,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2022-02-21 03:36:24,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2022-02-21 03:36:24,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 253 transitions. [2022-02-21 03:36:24,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:24,910 INFO L681 BuchiCegarLoop]: Abstraction has 197 states and 253 transitions. [2022-02-21 03:36:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 253 transitions. [2022-02-21 03:36:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 50. [2022-02-21 03:36:24,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:24,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states and 253 transitions. Second operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,913 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states and 253 transitions. Second operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,913 INFO L87 Difference]: Start difference. First operand 197 states and 253 transitions. Second operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,914 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:24,918 INFO L93 Difference]: Finished difference Result 197 states and 253 transitions. [2022-02-21 03:36:24,919 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 253 transitions. [2022-02-21 03:36:24,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:24,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:24,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 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 197 states and 253 transitions. [2022-02-21 03:36:24,920 INFO L87 Difference]: Start difference. First operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 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 197 states and 253 transitions. [2022-02-21 03:36:24,920 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:24,925 INFO L93 Difference]: Finished difference Result 197 states and 253 transitions. [2022-02-21 03:36:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 253 transitions. [2022-02-21 03:36:24,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:24,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:24,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:24,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-02-21 03:36:24,928 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-02-21 03:36:24,928 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-02-21 03:36:24,928 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:36:24,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2022-02-21 03:36:24,928 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2022-02-21 03:36:24,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:24,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:24,929 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2022-02-21 03:36:24,929 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:36:24,929 INFO L791 eck$LassoCheckResult]: Stem: 1593#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 1565#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 1566#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1599#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1600#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1596#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1597#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1604#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1603#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1602#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1601#L33-3 assume !(main_~x~0#1 < 100000); 1559#L33-4 main_~x~0#1 := 0; 1560#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 1573#L40-3 [2022-02-21 03:36:24,929 INFO L793 eck$LassoCheckResult]: Loop: 1573#L40-3 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1574#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1561#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;havoc main_#t~mem8#1; 1562#L40-2 main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1573#L40-3 [2022-02-21 03:36:24,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:24,930 INFO L85 PathProgramCache]: Analyzing trace with hash 82232677, now seen corresponding path program 2 times [2022-02-21 03:36:24,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:24,930 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361615944] [2022-02-21 03:36:24,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:24,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {2257#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {2257#true} is VALID [2022-02-21 03:36:24,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {2257#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:36:24,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:36:24,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:36:24,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:36:24,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:36:24,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:36:24,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:36:24,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:36:24,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:36:24,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} assume !(main_~x~0#1 < 100000); {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-21 03:36:24,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {2259#(= |ULTIMATE.start_main_~n~0#1| 0)} main_~x~0#1 := 0; {2260#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-21 03:36:24,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {2260#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; {2258#false} is VALID [2022-02-21 03:36:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-21 03:36:24,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:24,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361615944] [2022-02-21 03:36:24,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361615944] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:24,971 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:24,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:36:24,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385501838] [2022-02-21 03:36:24,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:24,975 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:24,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:24,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1915626, now seen corresponding path program 2 times [2022-02-21 03:36:24,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:24,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010548152] [2022-02-21 03:36:24,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:24,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:24,994 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:25,000 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:25,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:25,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:36:25,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:36:25,081 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:25,160 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-02-21 03:36:25,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:36:25,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:25,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:25,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2022-02-21 03:36:25,169 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2022-02-21 03:36:25,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 51 states and 63 transitions. [2022-02-21 03:36:25,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2022-02-21 03:36:25,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-02-21 03:36:25,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2022-02-21 03:36:25,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:25,171 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-02-21 03:36:25,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2022-02-21 03:36:25,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-02-21 03:36:25,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:25,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states and 63 transitions. Second operand has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:25,181 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states and 63 transitions. Second operand has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:25,181 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:25,182 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-02-21 03:36:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-02-21 03:36:25,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:25,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:25,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 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 51 states and 63 transitions. [2022-02-21 03:36:25,182 INFO L87 Difference]: Start difference. First operand has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 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 51 states and 63 transitions. [2022-02-21 03:36:25,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:25,188 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-02-21 03:36:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-02-21 03:36:25,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:25,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:25,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:25,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-02-21 03:36:25,189 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-02-21 03:36:25,189 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-02-21 03:36:25,189 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:36:25,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 62 transitions. [2022-02-21 03:36:25,190 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2022-02-21 03:36:25,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:25,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:25,191 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:25,191 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:25,191 INFO L791 eck$LassoCheckResult]: Stem: 2344#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 2323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 2324#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2347#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2348#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2352#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2358#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2357#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2356#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2354#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2353#L33-3 assume !(main_~x~0#1 < 100000); 2319#L33-4 main_~x~0#1 := 0; 2320#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 2336#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 2337#L47-3 [2022-02-21 03:36:25,191 INFO L793 eck$LassoCheckResult]: Loop: 2337#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 2338#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2337#L47-3 [2022-02-21 03:36:25,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:25,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754320, now seen corresponding path program 1 times [2022-02-21 03:36:25,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:25,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554264287] [2022-02-21 03:36:25,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:25,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:25,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {2471#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {2471#true} is VALID [2022-02-21 03:36:25,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {2471#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {2473#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:25,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {2473#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2473#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:25,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {2473#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2474#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:25,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {2474#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2474#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:25,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {2474#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2475#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:25,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {2475#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2475#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:25,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {2475#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2476#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:25,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {2476#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2476#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:25,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {2476#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2477#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:25,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {2477#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !(main_~x~0#1 < 100000); {2472#false} is VALID [2022-02-21 03:36:25,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {2472#false} main_~x~0#1 := 0; {2472#false} is VALID [2022-02-21 03:36:25,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#false} assume !(main_~x~0#1 < main_~n~0#1); {2472#false} is VALID [2022-02-21 03:36:25,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {2472#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {2472#false} is VALID [2022-02-21 03:36:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:25,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:25,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554264287] [2022-02-21 03:36:25,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554264287] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:25,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066722012] [2022-02-21 03:36:25,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:25,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:25,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,287 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:25,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-21 03:36:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:25,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:36:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:25,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:25,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {2471#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {2471#true} is VALID [2022-02-21 03:36:25,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {2471#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {2484#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:25,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {2484#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2484#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:25,427 INFO L290 TraceCheckUtils]: 3: Hoare triple {2484#(<= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2474#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:25,427 INFO L290 TraceCheckUtils]: 4: Hoare triple {2474#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2474#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:25,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {2474#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2475#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:25,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {2475#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2475#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:25,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {2475#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2476#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:25,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {2476#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2476#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:25,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {2476#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2477#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:25,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {2477#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !(main_~x~0#1 < 100000); {2472#false} is VALID [2022-02-21 03:36:25,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {2472#false} main_~x~0#1 := 0; {2472#false} is VALID [2022-02-21 03:36:25,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#false} assume !(main_~x~0#1 < main_~n~0#1); {2472#false} is VALID [2022-02-21 03:36:25,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {2472#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {2472#false} is VALID [2022-02-21 03:36:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:25,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:25,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {2472#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {2472#false} is VALID [2022-02-21 03:36:25,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#false} assume !(main_~x~0#1 < main_~n~0#1); {2472#false} is VALID [2022-02-21 03:36:25,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {2472#false} main_~x~0#1 := 0; {2472#false} is VALID [2022-02-21 03:36:25,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {2530#(< |ULTIMATE.start_main_~x~0#1| 100000)} assume !(main_~x~0#1 < 100000); {2472#false} is VALID [2022-02-21 03:36:25,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {2534#(< |ULTIMATE.start_main_~x~0#1| 99999)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2530#(< |ULTIMATE.start_main_~x~0#1| 100000)} is VALID [2022-02-21 03:36:25,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {2534#(< |ULTIMATE.start_main_~x~0#1| 99999)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2534#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-21 03:36:25,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {2541#(< |ULTIMATE.start_main_~x~0#1| 99998)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2534#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-21 03:36:25,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {2541#(< |ULTIMATE.start_main_~x~0#1| 99998)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2541#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-21 03:36:25,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {2548#(< |ULTIMATE.start_main_~x~0#1| 99997)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2541#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-21 03:36:25,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {2548#(< |ULTIMATE.start_main_~x~0#1| 99997)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2548#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-21 03:36:25,535 INFO L290 TraceCheckUtils]: 3: Hoare triple {2555#(< |ULTIMATE.start_main_~x~0#1| 99996)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {2548#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-21 03:36:25,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {2555#(< |ULTIMATE.start_main_~x~0#1| 99996)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {2555#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-21 03:36:25,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {2471#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {2555#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-21 03:36:25,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {2471#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {2471#true} is VALID [2022-02-21 03:36:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:25,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066722012] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:25,536 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:25,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-21 03:36:25,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271369950] [2022-02-21 03:36:25,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:25,537 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:25,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:25,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2022-02-21 03:36:25,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:25,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271155922] [2022-02-21 03:36:25,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:25,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:25,543 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:25,545 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:25,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:25,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:36:25,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:36:25,581 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. cyclomatic complexity: 17 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:26,203 INFO L93 Difference]: Finished difference Result 292 states and 374 transitions. [2022-02-21 03:36:26,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:36:26,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:26,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:26,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 374 transitions. [2022-02-21 03:36:26,232 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 234 [2022-02-21 03:36:26,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 292 states and 374 transitions. [2022-02-21 03:36:26,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 272 [2022-02-21 03:36:26,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 272 [2022-02-21 03:36:26,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 374 transitions. [2022-02-21 03:36:26,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:26,240 INFO L681 BuchiCegarLoop]: Abstraction has 292 states and 374 transitions. [2022-02-21 03:36:26,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 374 transitions. [2022-02-21 03:36:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 62. [2022-02-21 03:36:26,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:26,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 292 states and 374 transitions. Second operand has 62 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 61 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:26,243 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states and 374 transitions. Second operand has 62 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 61 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:26,243 INFO L87 Difference]: Start difference. First operand 292 states and 374 transitions. Second operand has 62 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 61 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:26,248 INFO L93 Difference]: Finished difference Result 292 states and 374 transitions. [2022-02-21 03:36:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 374 transitions. [2022-02-21 03:36:26,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:26,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:26,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 61 states have internal predecessors, (74), 0 states have call successors, (0), 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 292 states and 374 transitions. [2022-02-21 03:36:26,249 INFO L87 Difference]: Start difference. First operand has 62 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 61 states have internal predecessors, (74), 0 states have call successors, (0), 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 292 states and 374 transitions. [2022-02-21 03:36:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:26,255 INFO L93 Difference]: Finished difference Result 292 states and 374 transitions. [2022-02-21 03:36:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 374 transitions. [2022-02-21 03:36:26,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:26,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:26,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:26,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 61 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2022-02-21 03:36:26,257 INFO L704 BuchiCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-02-21 03:36:26,257 INFO L587 BuchiCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-02-21 03:36:26,257 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:36:26,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 74 transitions. [2022-02-21 03:36:26,257 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2022-02-21 03:36:26,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:26,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:26,258 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:26,258 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:26,258 INFO L791 eck$LassoCheckResult]: Stem: 2884#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 2861#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 2862#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2892#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2893#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2887#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2888#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2909#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2908#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2907#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2906#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2905#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2904#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2903#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2902#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2901#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2900#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2899#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2898#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2897#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2896#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2895#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2894#L33-3 assume !(main_~x~0#1 < 100000); 2859#L33-4 main_~x~0#1 := 0; 2860#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 2876#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 2877#L47-3 [2022-02-21 03:36:26,258 INFO L793 eck$LassoCheckResult]: Loop: 2877#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 2878#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2877#L47-3 [2022-02-21 03:36:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:26,258 INFO L85 PathProgramCache]: Analyzing trace with hash -95702852, now seen corresponding path program 2 times [2022-02-21 03:36:26,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:26,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148422368] [2022-02-21 03:36:26,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:26,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:26,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {3505#true} is VALID [2022-02-21 03:36:26,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {3507#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:26,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {3507#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3507#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:26,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {3507#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3508#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:26,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {3508#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3508#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:26,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {3508#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3509#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:26,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {3509#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3509#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:26,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {3509#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3510#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:26,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {3510#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3510#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:26,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {3510#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3511#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:26,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {3511#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3511#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:26,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {3511#(<= |ULTIMATE.start_main_~x~0#1| 4)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3512#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:36:26,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {3512#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3512#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:36:26,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {3512#(<= |ULTIMATE.start_main_~x~0#1| 5)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3513#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:36:26,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {3513#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3513#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:36:26,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {3513#(<= |ULTIMATE.start_main_~x~0#1| 6)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3514#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:36:26,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {3514#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3514#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:36:26,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {3514#(<= |ULTIMATE.start_main_~x~0#1| 7)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3515#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:36:26,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {3515#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3515#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:36:26,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {3515#(<= |ULTIMATE.start_main_~x~0#1| 8)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3516#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:36:26,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {3516#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3516#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:36:26,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {3516#(<= |ULTIMATE.start_main_~x~0#1| 9)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3517#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:36:26,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {3517#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !(main_~x~0#1 < 100000); {3506#false} is VALID [2022-02-21 03:36:26,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {3506#false} main_~x~0#1 := 0; {3506#false} is VALID [2022-02-21 03:36:26,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {3506#false} assume !(main_~x~0#1 < main_~n~0#1); {3506#false} is VALID [2022-02-21 03:36:26,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {3506#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {3506#false} is VALID [2022-02-21 03:36:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:26,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:26,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148422368] [2022-02-21 03:36:26,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148422368] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:26,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048828037] [2022-02-21 03:36:26,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:36:26,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:26,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,409 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:26,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-21 03:36:26,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:36:26,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:26,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:36:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:26,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:26,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {3505#true} is VALID [2022-02-21 03:36:26,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {3524#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:26,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {3524#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3524#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:26,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {3524#(<= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3508#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:26,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {3508#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3508#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:26,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {3508#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3509#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:26,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {3509#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3509#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:26,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {3509#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3510#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:26,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {3510#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3510#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:26,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {3510#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3511#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:26,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {3511#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3511#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:26,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {3511#(<= |ULTIMATE.start_main_~x~0#1| 4)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3512#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:36:26,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {3512#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3512#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:36:26,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {3512#(<= |ULTIMATE.start_main_~x~0#1| 5)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3513#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:36:26,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {3513#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3513#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:36:26,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {3513#(<= |ULTIMATE.start_main_~x~0#1| 6)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3514#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:36:26,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {3514#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3514#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:36:26,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {3514#(<= |ULTIMATE.start_main_~x~0#1| 7)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3515#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:36:26,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {3515#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3515#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:36:26,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {3515#(<= |ULTIMATE.start_main_~x~0#1| 8)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3516#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:36:26,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {3516#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3516#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:36:26,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {3516#(<= |ULTIMATE.start_main_~x~0#1| 9)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3517#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:36:26,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {3517#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !(main_~x~0#1 < 100000); {3506#false} is VALID [2022-02-21 03:36:26,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {3506#false} main_~x~0#1 := 0; {3506#false} is VALID [2022-02-21 03:36:26,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {3506#false} assume !(main_~x~0#1 < main_~n~0#1); {3506#false} is VALID [2022-02-21 03:36:26,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {3506#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {3506#false} is VALID [2022-02-21 03:36:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:26,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:27,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {3506#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {3506#false} is VALID [2022-02-21 03:36:27,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {3506#false} assume !(main_~x~0#1 < main_~n~0#1); {3506#false} is VALID [2022-02-21 03:36:27,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {3506#false} main_~x~0#1 := 0; {3506#false} is VALID [2022-02-21 03:36:27,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {3606#(< |ULTIMATE.start_main_~x~0#1| 100000)} assume !(main_~x~0#1 < 100000); {3506#false} is VALID [2022-02-21 03:36:27,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {3610#(< |ULTIMATE.start_main_~x~0#1| 99999)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3606#(< |ULTIMATE.start_main_~x~0#1| 100000)} is VALID [2022-02-21 03:36:27,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {3610#(< |ULTIMATE.start_main_~x~0#1| 99999)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3610#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-21 03:36:27,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {3617#(< |ULTIMATE.start_main_~x~0#1| 99998)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3610#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-21 03:36:27,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {3617#(< |ULTIMATE.start_main_~x~0#1| 99998)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3617#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-21 03:36:27,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {3624#(< |ULTIMATE.start_main_~x~0#1| 99997)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3617#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-21 03:36:27,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {3624#(< |ULTIMATE.start_main_~x~0#1| 99997)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3624#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-21 03:36:27,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {3631#(< |ULTIMATE.start_main_~x~0#1| 99996)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3624#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-21 03:36:27,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {3631#(< |ULTIMATE.start_main_~x~0#1| 99996)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3631#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-21 03:36:27,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {3638#(< |ULTIMATE.start_main_~x~0#1| 99995)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3631#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-21 03:36:27,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {3638#(< |ULTIMATE.start_main_~x~0#1| 99995)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3638#(< |ULTIMATE.start_main_~x~0#1| 99995)} is VALID [2022-02-21 03:36:27,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {3645#(< |ULTIMATE.start_main_~x~0#1| 99994)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3638#(< |ULTIMATE.start_main_~x~0#1| 99995)} is VALID [2022-02-21 03:36:27,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {3645#(< |ULTIMATE.start_main_~x~0#1| 99994)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3645#(< |ULTIMATE.start_main_~x~0#1| 99994)} is VALID [2022-02-21 03:36:27,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {3652#(< |ULTIMATE.start_main_~x~0#1| 99993)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3645#(< |ULTIMATE.start_main_~x~0#1| 99994)} is VALID [2022-02-21 03:36:27,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {3652#(< |ULTIMATE.start_main_~x~0#1| 99993)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3652#(< |ULTIMATE.start_main_~x~0#1| 99993)} is VALID [2022-02-21 03:36:27,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {3659#(< |ULTIMATE.start_main_~x~0#1| 99992)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3652#(< |ULTIMATE.start_main_~x~0#1| 99993)} is VALID [2022-02-21 03:36:27,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {3659#(< |ULTIMATE.start_main_~x~0#1| 99992)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3659#(< |ULTIMATE.start_main_~x~0#1| 99992)} is VALID [2022-02-21 03:36:27,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {3666#(< |ULTIMATE.start_main_~x~0#1| 99991)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3659#(< |ULTIMATE.start_main_~x~0#1| 99992)} is VALID [2022-02-21 03:36:27,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {3666#(< |ULTIMATE.start_main_~x~0#1| 99991)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3666#(< |ULTIMATE.start_main_~x~0#1| 99991)} is VALID [2022-02-21 03:36:27,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {3673#(< |ULTIMATE.start_main_~x~0#1| 99990)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {3666#(< |ULTIMATE.start_main_~x~0#1| 99991)} is VALID [2022-02-21 03:36:27,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {3673#(< |ULTIMATE.start_main_~x~0#1| 99990)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {3673#(< |ULTIMATE.start_main_~x~0#1| 99990)} is VALID [2022-02-21 03:36:27,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {3673#(< |ULTIMATE.start_main_~x~0#1| 99990)} is VALID [2022-02-21 03:36:27,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {3505#true} is VALID [2022-02-21 03:36:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:27,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048828037] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:27,035 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:27,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-21 03:36:27,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097401950] [2022-02-21 03:36:27,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:27,036 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:27,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:27,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2022-02-21 03:36:27,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:27,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471545658] [2022-02-21 03:36:27,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:27,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:27,041 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:27,044 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:27,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:27,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-21 03:36:27,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:36:27,071 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. cyclomatic complexity: 17 Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:28,341 INFO L93 Difference]: Finished difference Result 592 states and 758 transitions. [2022-02-21 03:36:28,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:36:28,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:28,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:28,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 592 states and 758 transitions. [2022-02-21 03:36:28,393 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 474 [2022-02-21 03:36:28,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 592 states to 592 states and 758 transitions. [2022-02-21 03:36:28,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 548 [2022-02-21 03:36:28,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 548 [2022-02-21 03:36:28,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 592 states and 758 transitions. [2022-02-21 03:36:28,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:28,406 INFO L681 BuchiCegarLoop]: Abstraction has 592 states and 758 transitions. [2022-02-21 03:36:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states and 758 transitions. [2022-02-21 03:36:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 86. [2022-02-21 03:36:28,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:28,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 592 states and 758 transitions. Second operand has 86 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 85 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:28,409 INFO L74 IsIncluded]: Start isIncluded. First operand 592 states and 758 transitions. Second operand has 86 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 85 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:28,409 INFO L87 Difference]: Start difference. First operand 592 states and 758 transitions. Second operand has 86 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 85 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:28,419 INFO L93 Difference]: Finished difference Result 592 states and 758 transitions. [2022-02-21 03:36:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 758 transitions. [2022-02-21 03:36:28,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:28,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:28,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 85 states have internal predecessors, (98), 0 states have call successors, (0), 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 592 states and 758 transitions. [2022-02-21 03:36:28,420 INFO L87 Difference]: Start difference. First operand has 86 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 85 states have internal predecessors, (98), 0 states have call successors, (0), 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 592 states and 758 transitions. [2022-02-21 03:36:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:28,430 INFO L93 Difference]: Finished difference Result 592 states and 758 transitions. [2022-02-21 03:36:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 758 transitions. [2022-02-21 03:36:28,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:28,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:28,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:28,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 85 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2022-02-21 03:36:28,433 INFO L704 BuchiCegarLoop]: Abstraction has 86 states and 98 transitions. [2022-02-21 03:36:28,433 INFO L587 BuchiCegarLoop]: Abstraction has 86 states and 98 transitions. [2022-02-21 03:36:28,433 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:36:28,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 98 transitions. [2022-02-21 03:36:28,433 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2022-02-21 03:36:28,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:28,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:28,434 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:28,434 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:28,434 INFO L791 eck$LassoCheckResult]: Stem: 4305#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 4281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 4282#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4315#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4316#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4310#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4311#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4356#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4355#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4354#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4353#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4352#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4351#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4350#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4349#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4348#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4347#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4346#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4345#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4344#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4343#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4342#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4341#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4340#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4339#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4338#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4337#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4336#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4335#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4334#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4333#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4332#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4331#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4330#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4329#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4328#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4327#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4326#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4325#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4324#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4323#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4322#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4321#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4320#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4319#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4318#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 4317#L33-3 assume !(main_~x~0#1 < 100000); 4277#L33-4 main_~x~0#1 := 0; 4278#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 4297#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 4298#L47-3 [2022-02-21 03:36:28,434 INFO L793 eck$LassoCheckResult]: Loop: 4298#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 4299#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4298#L47-3 [2022-02-21 03:36:28,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1293970900, now seen corresponding path program 3 times [2022-02-21 03:36:28,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:28,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994392643] [2022-02-21 03:36:28,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:28,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:28,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {5547#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {5547#true} is VALID [2022-02-21 03:36:28,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {5547#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {5549#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:28,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {5549#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5549#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:28,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {5549#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5550#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:28,777 INFO L290 TraceCheckUtils]: 4: Hoare triple {5550#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5550#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:28,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {5550#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5551#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:28,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {5551#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5551#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:28,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {5551#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5552#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:28,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {5552#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5552#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:28,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {5552#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5553#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:28,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {5553#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5553#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:28,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {5553#(<= |ULTIMATE.start_main_~x~0#1| 4)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5554#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:36:28,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {5554#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5554#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:36:28,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {5554#(<= |ULTIMATE.start_main_~x~0#1| 5)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5555#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:36:28,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {5555#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5555#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:36:28,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {5555#(<= |ULTIMATE.start_main_~x~0#1| 6)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5556#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:36:28,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {5556#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5556#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:36:28,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {5556#(<= |ULTIMATE.start_main_~x~0#1| 7)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5557#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:36:28,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {5557#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5557#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:36:28,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {5557#(<= |ULTIMATE.start_main_~x~0#1| 8)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5558#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:36:28,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {5558#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5558#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:36:28,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {5558#(<= |ULTIMATE.start_main_~x~0#1| 9)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5559#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:36:28,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {5559#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5559#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:36:28,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {5559#(<= |ULTIMATE.start_main_~x~0#1| 10)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5560#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:36:28,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {5560#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5560#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:36:28,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {5560#(<= |ULTIMATE.start_main_~x~0#1| 11)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5561#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-21 03:36:28,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {5561#(<= |ULTIMATE.start_main_~x~0#1| 12)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5561#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-21 03:36:28,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {5561#(<= |ULTIMATE.start_main_~x~0#1| 12)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5562#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-21 03:36:28,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {5562#(<= |ULTIMATE.start_main_~x~0#1| 13)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5562#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-21 03:36:28,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {5562#(<= |ULTIMATE.start_main_~x~0#1| 13)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5563#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-21 03:36:28,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {5563#(<= |ULTIMATE.start_main_~x~0#1| 14)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5563#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-21 03:36:28,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {5563#(<= |ULTIMATE.start_main_~x~0#1| 14)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5564#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-21 03:36:28,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {5564#(<= |ULTIMATE.start_main_~x~0#1| 15)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5564#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-21 03:36:28,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {5564#(<= |ULTIMATE.start_main_~x~0#1| 15)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5565#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:36:28,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {5565#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5565#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:36:28,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {5565#(<= |ULTIMATE.start_main_~x~0#1| 16)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5566#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-21 03:36:28,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {5566#(<= |ULTIMATE.start_main_~x~0#1| 17)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5566#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-21 03:36:28,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {5566#(<= |ULTIMATE.start_main_~x~0#1| 17)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5567#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-21 03:36:28,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {5567#(<= |ULTIMATE.start_main_~x~0#1| 18)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5567#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-21 03:36:28,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {5567#(<= |ULTIMATE.start_main_~x~0#1| 18)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5568#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-21 03:36:28,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {5568#(<= |ULTIMATE.start_main_~x~0#1| 19)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5568#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-21 03:36:28,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {5568#(<= |ULTIMATE.start_main_~x~0#1| 19)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5569#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-21 03:36:28,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {5569#(<= |ULTIMATE.start_main_~x~0#1| 20)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5569#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-21 03:36:28,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {5569#(<= |ULTIMATE.start_main_~x~0#1| 20)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5570#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-21 03:36:28,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {5570#(<= |ULTIMATE.start_main_~x~0#1| 21)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5570#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-21 03:36:28,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {5570#(<= |ULTIMATE.start_main_~x~0#1| 21)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5571#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-21 03:36:28,804 INFO L290 TraceCheckUtils]: 46: Hoare triple {5571#(<= |ULTIMATE.start_main_~x~0#1| 22)} assume !(main_~x~0#1 < 100000); {5548#false} is VALID [2022-02-21 03:36:28,804 INFO L290 TraceCheckUtils]: 47: Hoare triple {5548#false} main_~x~0#1 := 0; {5548#false} is VALID [2022-02-21 03:36:28,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {5548#false} assume !(main_~x~0#1 < main_~n~0#1); {5548#false} is VALID [2022-02-21 03:36:28,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {5548#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {5548#false} is VALID [2022-02-21 03:36:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:28,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:28,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994392643] [2022-02-21 03:36:28,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994392643] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:28,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117425211] [2022-02-21 03:36:28,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:36:28,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:28,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:28,808 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:28,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-21 03:36:29,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2022-02-21 03:36:29,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:29,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 03:36:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:29,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:29,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {5547#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {5547#true} is VALID [2022-02-21 03:36:29,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {5547#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {5578#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:29,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {5578#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5578#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:29,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {5578#(<= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5550#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:29,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {5550#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5550#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:29,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {5550#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5551#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:29,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {5551#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5551#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:29,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {5551#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5552#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:29,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {5552#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5552#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:29,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {5552#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5553#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:29,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {5553#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5553#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:29,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {5553#(<= |ULTIMATE.start_main_~x~0#1| 4)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5554#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:36:29,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {5554#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5554#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:36:29,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {5554#(<= |ULTIMATE.start_main_~x~0#1| 5)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5555#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:36:29,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {5555#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5555#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:36:29,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {5555#(<= |ULTIMATE.start_main_~x~0#1| 6)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5556#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:36:29,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {5556#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5556#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:36:29,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {5556#(<= |ULTIMATE.start_main_~x~0#1| 7)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5557#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:36:29,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {5557#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5557#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:36:29,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {5557#(<= |ULTIMATE.start_main_~x~0#1| 8)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5558#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:36:29,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {5558#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5558#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:36:29,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {5558#(<= |ULTIMATE.start_main_~x~0#1| 9)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5559#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:36:29,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {5559#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5559#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:36:29,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {5559#(<= |ULTIMATE.start_main_~x~0#1| 10)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5560#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:36:29,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {5560#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5560#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:36:29,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {5560#(<= |ULTIMATE.start_main_~x~0#1| 11)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5561#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-21 03:36:29,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {5561#(<= |ULTIMATE.start_main_~x~0#1| 12)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5561#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-21 03:36:29,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {5561#(<= |ULTIMATE.start_main_~x~0#1| 12)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5562#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-21 03:36:29,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {5562#(<= |ULTIMATE.start_main_~x~0#1| 13)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5562#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-21 03:36:29,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {5562#(<= |ULTIMATE.start_main_~x~0#1| 13)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5563#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-21 03:36:29,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {5563#(<= |ULTIMATE.start_main_~x~0#1| 14)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5563#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-21 03:36:29,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {5563#(<= |ULTIMATE.start_main_~x~0#1| 14)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5564#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-21 03:36:29,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {5564#(<= |ULTIMATE.start_main_~x~0#1| 15)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5564#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-21 03:36:29,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {5564#(<= |ULTIMATE.start_main_~x~0#1| 15)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5565#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:36:29,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {5565#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5565#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:36:29,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {5565#(<= |ULTIMATE.start_main_~x~0#1| 16)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5566#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-21 03:36:29,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {5566#(<= |ULTIMATE.start_main_~x~0#1| 17)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5566#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-21 03:36:29,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {5566#(<= |ULTIMATE.start_main_~x~0#1| 17)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5567#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-21 03:36:29,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {5567#(<= |ULTIMATE.start_main_~x~0#1| 18)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5567#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-21 03:36:29,935 INFO L290 TraceCheckUtils]: 39: Hoare triple {5567#(<= |ULTIMATE.start_main_~x~0#1| 18)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5568#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-21 03:36:29,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {5568#(<= |ULTIMATE.start_main_~x~0#1| 19)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5568#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-21 03:36:29,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {5568#(<= |ULTIMATE.start_main_~x~0#1| 19)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5569#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-21 03:36:29,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {5569#(<= |ULTIMATE.start_main_~x~0#1| 20)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5569#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-21 03:36:29,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {5569#(<= |ULTIMATE.start_main_~x~0#1| 20)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5570#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-21 03:36:29,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {5570#(<= |ULTIMATE.start_main_~x~0#1| 21)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5570#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-21 03:36:29,937 INFO L290 TraceCheckUtils]: 45: Hoare triple {5570#(<= |ULTIMATE.start_main_~x~0#1| 21)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5571#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-21 03:36:29,937 INFO L290 TraceCheckUtils]: 46: Hoare triple {5571#(<= |ULTIMATE.start_main_~x~0#1| 22)} assume !(main_~x~0#1 < 100000); {5548#false} is VALID [2022-02-21 03:36:29,937 INFO L290 TraceCheckUtils]: 47: Hoare triple {5548#false} main_~x~0#1 := 0; {5548#false} is VALID [2022-02-21 03:36:29,937 INFO L290 TraceCheckUtils]: 48: Hoare triple {5548#false} assume !(main_~x~0#1 < main_~n~0#1); {5548#false} is VALID [2022-02-21 03:36:29,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {5548#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {5548#false} is VALID [2022-02-21 03:36:29,938 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:29,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:30,842 INFO L290 TraceCheckUtils]: 49: Hoare triple {5548#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {5548#false} is VALID [2022-02-21 03:36:30,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {5548#false} assume !(main_~x~0#1 < main_~n~0#1); {5548#false} is VALID [2022-02-21 03:36:30,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {5548#false} main_~x~0#1 := 0; {5548#false} is VALID [2022-02-21 03:36:30,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {5732#(< |ULTIMATE.start_main_~x~0#1| 100000)} assume !(main_~x~0#1 < 100000); {5548#false} is VALID [2022-02-21 03:36:30,844 INFO L290 TraceCheckUtils]: 45: Hoare triple {5736#(< |ULTIMATE.start_main_~x~0#1| 99999)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5732#(< |ULTIMATE.start_main_~x~0#1| 100000)} is VALID [2022-02-21 03:36:30,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {5736#(< |ULTIMATE.start_main_~x~0#1| 99999)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5736#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-21 03:36:30,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {5743#(< |ULTIMATE.start_main_~x~0#1| 99998)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5736#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-21 03:36:30,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {5743#(< |ULTIMATE.start_main_~x~0#1| 99998)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5743#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-21 03:36:30,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {5750#(< |ULTIMATE.start_main_~x~0#1| 99997)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5743#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-21 03:36:30,848 INFO L290 TraceCheckUtils]: 40: Hoare triple {5750#(< |ULTIMATE.start_main_~x~0#1| 99997)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5750#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-21 03:36:30,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {5757#(< |ULTIMATE.start_main_~x~0#1| 99996)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5750#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-21 03:36:30,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {5757#(< |ULTIMATE.start_main_~x~0#1| 99996)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5757#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-21 03:36:30,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {5764#(< |ULTIMATE.start_main_~x~0#1| 99995)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5757#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-21 03:36:30,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {5764#(< |ULTIMATE.start_main_~x~0#1| 99995)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5764#(< |ULTIMATE.start_main_~x~0#1| 99995)} is VALID [2022-02-21 03:36:30,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {5771#(< |ULTIMATE.start_main_~x~0#1| 99994)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5764#(< |ULTIMATE.start_main_~x~0#1| 99995)} is VALID [2022-02-21 03:36:30,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {5771#(< |ULTIMATE.start_main_~x~0#1| 99994)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5771#(< |ULTIMATE.start_main_~x~0#1| 99994)} is VALID [2022-02-21 03:36:30,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {5778#(< |ULTIMATE.start_main_~x~0#1| 99993)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5771#(< |ULTIMATE.start_main_~x~0#1| 99994)} is VALID [2022-02-21 03:36:30,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {5778#(< |ULTIMATE.start_main_~x~0#1| 99993)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5778#(< |ULTIMATE.start_main_~x~0#1| 99993)} is VALID [2022-02-21 03:36:30,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {5785#(< |ULTIMATE.start_main_~x~0#1| 99992)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5778#(< |ULTIMATE.start_main_~x~0#1| 99993)} is VALID [2022-02-21 03:36:30,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {5785#(< |ULTIMATE.start_main_~x~0#1| 99992)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5785#(< |ULTIMATE.start_main_~x~0#1| 99992)} is VALID [2022-02-21 03:36:30,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {5792#(< |ULTIMATE.start_main_~x~0#1| 99991)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5785#(< |ULTIMATE.start_main_~x~0#1| 99992)} is VALID [2022-02-21 03:36:30,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {5792#(< |ULTIMATE.start_main_~x~0#1| 99991)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5792#(< |ULTIMATE.start_main_~x~0#1| 99991)} is VALID [2022-02-21 03:36:30,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {5799#(< |ULTIMATE.start_main_~x~0#1| 99990)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5792#(< |ULTIMATE.start_main_~x~0#1| 99991)} is VALID [2022-02-21 03:36:30,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {5799#(< |ULTIMATE.start_main_~x~0#1| 99990)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5799#(< |ULTIMATE.start_main_~x~0#1| 99990)} is VALID [2022-02-21 03:36:30,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {5806#(< |ULTIMATE.start_main_~x~0#1| 99989)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5799#(< |ULTIMATE.start_main_~x~0#1| 99990)} is VALID [2022-02-21 03:36:30,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {5806#(< |ULTIMATE.start_main_~x~0#1| 99989)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5806#(< |ULTIMATE.start_main_~x~0#1| 99989)} is VALID [2022-02-21 03:36:30,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {5813#(< |ULTIMATE.start_main_~x~0#1| 99988)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5806#(< |ULTIMATE.start_main_~x~0#1| 99989)} is VALID [2022-02-21 03:36:30,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {5813#(< |ULTIMATE.start_main_~x~0#1| 99988)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5813#(< |ULTIMATE.start_main_~x~0#1| 99988)} is VALID [2022-02-21 03:36:30,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {5820#(< |ULTIMATE.start_main_~x~0#1| 99987)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5813#(< |ULTIMATE.start_main_~x~0#1| 99988)} is VALID [2022-02-21 03:36:30,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {5820#(< |ULTIMATE.start_main_~x~0#1| 99987)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5820#(< |ULTIMATE.start_main_~x~0#1| 99987)} is VALID [2022-02-21 03:36:30,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {5827#(< |ULTIMATE.start_main_~x~0#1| 99986)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5820#(< |ULTIMATE.start_main_~x~0#1| 99987)} is VALID [2022-02-21 03:36:30,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {5827#(< |ULTIMATE.start_main_~x~0#1| 99986)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5827#(< |ULTIMATE.start_main_~x~0#1| 99986)} is VALID [2022-02-21 03:36:30,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {5834#(< |ULTIMATE.start_main_~x~0#1| 99985)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5827#(< |ULTIMATE.start_main_~x~0#1| 99986)} is VALID [2022-02-21 03:36:30,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {5834#(< |ULTIMATE.start_main_~x~0#1| 99985)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5834#(< |ULTIMATE.start_main_~x~0#1| 99985)} is VALID [2022-02-21 03:36:30,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {5841#(< |ULTIMATE.start_main_~x~0#1| 99984)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5834#(< |ULTIMATE.start_main_~x~0#1| 99985)} is VALID [2022-02-21 03:36:30,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {5841#(< |ULTIMATE.start_main_~x~0#1| 99984)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5841#(< |ULTIMATE.start_main_~x~0#1| 99984)} is VALID [2022-02-21 03:36:30,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {5848#(< |ULTIMATE.start_main_~x~0#1| 99983)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5841#(< |ULTIMATE.start_main_~x~0#1| 99984)} is VALID [2022-02-21 03:36:30,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {5848#(< |ULTIMATE.start_main_~x~0#1| 99983)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5848#(< |ULTIMATE.start_main_~x~0#1| 99983)} is VALID [2022-02-21 03:36:30,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {5855#(< |ULTIMATE.start_main_~x~0#1| 99982)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5848#(< |ULTIMATE.start_main_~x~0#1| 99983)} is VALID [2022-02-21 03:36:30,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {5855#(< |ULTIMATE.start_main_~x~0#1| 99982)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5855#(< |ULTIMATE.start_main_~x~0#1| 99982)} is VALID [2022-02-21 03:36:30,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {5862#(< |ULTIMATE.start_main_~x~0#1| 99981)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5855#(< |ULTIMATE.start_main_~x~0#1| 99982)} is VALID [2022-02-21 03:36:30,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {5862#(< |ULTIMATE.start_main_~x~0#1| 99981)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5862#(< |ULTIMATE.start_main_~x~0#1| 99981)} is VALID [2022-02-21 03:36:30,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {5869#(< |ULTIMATE.start_main_~x~0#1| 99980)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5862#(< |ULTIMATE.start_main_~x~0#1| 99981)} is VALID [2022-02-21 03:36:30,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {5869#(< |ULTIMATE.start_main_~x~0#1| 99980)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5869#(< |ULTIMATE.start_main_~x~0#1| 99980)} is VALID [2022-02-21 03:36:30,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {5876#(< |ULTIMATE.start_main_~x~0#1| 99979)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5869#(< |ULTIMATE.start_main_~x~0#1| 99980)} is VALID [2022-02-21 03:36:30,863 INFO L290 TraceCheckUtils]: 4: Hoare triple {5876#(< |ULTIMATE.start_main_~x~0#1| 99979)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5876#(< |ULTIMATE.start_main_~x~0#1| 99979)} is VALID [2022-02-21 03:36:30,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {5883#(< |ULTIMATE.start_main_~x~0#1| 99978)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {5876#(< |ULTIMATE.start_main_~x~0#1| 99979)} is VALID [2022-02-21 03:36:30,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {5883#(< |ULTIMATE.start_main_~x~0#1| 99978)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {5883#(< |ULTIMATE.start_main_~x~0#1| 99978)} is VALID [2022-02-21 03:36:30,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {5547#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {5883#(< |ULTIMATE.start_main_~x~0#1| 99978)} is VALID [2022-02-21 03:36:30,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {5547#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {5547#true} is VALID [2022-02-21 03:36:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:30,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117425211] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:30,865 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:30,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-21 03:36:30,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367390971] [2022-02-21 03:36:30,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:30,866 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:30,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:30,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 3 times [2022-02-21 03:36:30,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:30,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498430089] [2022-02-21 03:36:30,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:30,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,871 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,873 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:30,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:30,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-21 03:36:30,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-21 03:36:30,927 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. cyclomatic complexity: 17 Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:35,148 INFO L93 Difference]: Finished difference Result 1192 states and 1526 transitions. [2022-02-21 03:36:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-21 03:36:35,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:35,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:35,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1192 states and 1526 transitions. [2022-02-21 03:36:35,294 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 954 [2022-02-21 03:36:35,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1192 states to 1192 states and 1526 transitions. [2022-02-21 03:36:35,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1100 [2022-02-21 03:36:35,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1100 [2022-02-21 03:36:35,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1192 states and 1526 transitions. [2022-02-21 03:36:35,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:35,352 INFO L681 BuchiCegarLoop]: Abstraction has 1192 states and 1526 transitions. [2022-02-21 03:36:35,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states and 1526 transitions. [2022-02-21 03:36:35,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 134. [2022-02-21 03:36:35,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:35,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1192 states and 1526 transitions. Second operand has 134 states, 134 states have (on average 1.0895522388059702) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:35,358 INFO L74 IsIncluded]: Start isIncluded. First operand 1192 states and 1526 transitions. Second operand has 134 states, 134 states have (on average 1.0895522388059702) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:35,358 INFO L87 Difference]: Start difference. First operand 1192 states and 1526 transitions. Second operand has 134 states, 134 states have (on average 1.0895522388059702) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:35,410 INFO L93 Difference]: Finished difference Result 1192 states and 1526 transitions. [2022-02-21 03:36:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1526 transitions. [2022-02-21 03:36:35,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:35,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:35,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 134 states have (on average 1.0895522388059702) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 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 1192 states and 1526 transitions. [2022-02-21 03:36:35,413 INFO L87 Difference]: Start difference. First operand has 134 states, 134 states have (on average 1.0895522388059702) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 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 1192 states and 1526 transitions. [2022-02-21 03:36:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:35,465 INFO L93 Difference]: Finished difference Result 1192 states and 1526 transitions. [2022-02-21 03:36:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1526 transitions. [2022-02-21 03:36:35,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:35,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:35,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:35,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 1.0895522388059702) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-02-21 03:36:35,469 INFO L704 BuchiCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-02-21 03:36:35,469 INFO L587 BuchiCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-02-21 03:36:35,469 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:36:35,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 146 transitions. [2022-02-21 03:36:35,470 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2022-02-21 03:36:35,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:35,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:35,471 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:35,471 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:35,471 INFO L791 eck$LassoCheckResult]: Stem: 7115#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 7091#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 7092#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7125#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7126#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7120#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7121#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7214#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7213#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7212#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7211#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7210#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7209#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7208#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7207#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7206#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7205#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7204#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7203#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7202#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7201#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7200#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7199#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7198#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7197#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7196#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7195#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7194#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7193#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7192#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7191#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7190#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7189#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7188#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7187#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7186#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7185#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7184#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7183#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7182#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7181#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7180#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7179#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7178#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7177#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7176#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7175#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7174#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7173#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7172#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7171#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7170#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7169#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7168#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7167#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7166#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7165#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7164#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7163#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7162#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7161#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7160#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7159#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7158#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7157#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7156#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7155#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7154#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7153#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7152#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7151#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7150#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7149#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7148#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7147#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7146#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7145#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7144#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7143#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7142#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7141#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7140#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7139#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7138#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7137#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7136#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7135#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7134#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7133#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7132#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7131#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7130#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7129#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7128#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7127#L33-3 assume !(main_~x~0#1 < 100000); 7087#L33-4 main_~x~0#1 := 0; 7088#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 7107#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 7108#L47-3 [2022-02-21 03:36:35,472 INFO L793 eck$LassoCheckResult]: Loop: 7108#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 7109#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7108#L47-3 [2022-02-21 03:36:35,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:35,472 INFO L85 PathProgramCache]: Analyzing trace with hash -675115004, now seen corresponding path program 4 times [2022-02-21 03:36:35,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:35,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935235778] [2022-02-21 03:36:35,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:35,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:36,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {9605#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {9605#true} is VALID [2022-02-21 03:36:36,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {9605#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {9607#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:36,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {9607#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9607#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:36,535 INFO L290 TraceCheckUtils]: 3: Hoare triple {9607#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9608#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:36,543 INFO L290 TraceCheckUtils]: 4: Hoare triple {9608#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9608#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:36,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {9608#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9609#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:36,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {9609#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9609#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:36,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {9609#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9610#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:36,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {9610#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9610#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:36,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {9610#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9611#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:36,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {9611#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9611#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:36,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {9611#(<= |ULTIMATE.start_main_~x~0#1| 4)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9612#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:36:36,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {9612#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9612#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:36:36,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {9612#(<= |ULTIMATE.start_main_~x~0#1| 5)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9613#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:36:36,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {9613#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9613#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:36:36,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {9613#(<= |ULTIMATE.start_main_~x~0#1| 6)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9614#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:36:36,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {9614#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9614#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:36:36,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {9614#(<= |ULTIMATE.start_main_~x~0#1| 7)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9615#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:36:36,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {9615#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9615#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:36:36,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {9615#(<= |ULTIMATE.start_main_~x~0#1| 8)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9616#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:36:36,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {9616#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9616#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:36:36,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {9616#(<= |ULTIMATE.start_main_~x~0#1| 9)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9617#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:36:36,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {9617#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9617#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:36:36,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {9617#(<= |ULTIMATE.start_main_~x~0#1| 10)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9618#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:36:36,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {9618#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9618#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:36:36,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {9618#(<= |ULTIMATE.start_main_~x~0#1| 11)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9619#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-21 03:36:36,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {9619#(<= |ULTIMATE.start_main_~x~0#1| 12)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9619#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-21 03:36:36,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {9619#(<= |ULTIMATE.start_main_~x~0#1| 12)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9620#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-21 03:36:36,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {9620#(<= |ULTIMATE.start_main_~x~0#1| 13)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9620#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-21 03:36:36,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {9620#(<= |ULTIMATE.start_main_~x~0#1| 13)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9621#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-21 03:36:36,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {9621#(<= |ULTIMATE.start_main_~x~0#1| 14)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9621#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-21 03:36:36,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {9621#(<= |ULTIMATE.start_main_~x~0#1| 14)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9622#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-21 03:36:36,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {9622#(<= |ULTIMATE.start_main_~x~0#1| 15)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9622#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-21 03:36:36,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {9622#(<= |ULTIMATE.start_main_~x~0#1| 15)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9623#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:36:36,566 INFO L290 TraceCheckUtils]: 34: Hoare triple {9623#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9623#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:36:36,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {9623#(<= |ULTIMATE.start_main_~x~0#1| 16)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9624#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-21 03:36:36,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {9624#(<= |ULTIMATE.start_main_~x~0#1| 17)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9624#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-21 03:36:36,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {9624#(<= |ULTIMATE.start_main_~x~0#1| 17)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9625#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-21 03:36:36,570 INFO L290 TraceCheckUtils]: 38: Hoare triple {9625#(<= |ULTIMATE.start_main_~x~0#1| 18)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9625#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-21 03:36:36,570 INFO L290 TraceCheckUtils]: 39: Hoare triple {9625#(<= |ULTIMATE.start_main_~x~0#1| 18)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9626#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-21 03:36:36,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {9626#(<= |ULTIMATE.start_main_~x~0#1| 19)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9626#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-21 03:36:36,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {9626#(<= |ULTIMATE.start_main_~x~0#1| 19)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9627#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-21 03:36:36,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {9627#(<= |ULTIMATE.start_main_~x~0#1| 20)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9627#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-21 03:36:36,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {9627#(<= |ULTIMATE.start_main_~x~0#1| 20)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9628#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-21 03:36:36,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {9628#(<= |ULTIMATE.start_main_~x~0#1| 21)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9628#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-21 03:36:36,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {9628#(<= |ULTIMATE.start_main_~x~0#1| 21)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9629#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-21 03:36:36,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {9629#(<= |ULTIMATE.start_main_~x~0#1| 22)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9629#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-21 03:36:36,574 INFO L290 TraceCheckUtils]: 47: Hoare triple {9629#(<= |ULTIMATE.start_main_~x~0#1| 22)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9630#(<= |ULTIMATE.start_main_~x~0#1| 23)} is VALID [2022-02-21 03:36:36,574 INFO L290 TraceCheckUtils]: 48: Hoare triple {9630#(<= |ULTIMATE.start_main_~x~0#1| 23)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9630#(<= |ULTIMATE.start_main_~x~0#1| 23)} is VALID [2022-02-21 03:36:36,579 INFO L290 TraceCheckUtils]: 49: Hoare triple {9630#(<= |ULTIMATE.start_main_~x~0#1| 23)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9631#(<= |ULTIMATE.start_main_~x~0#1| 24)} is VALID [2022-02-21 03:36:36,579 INFO L290 TraceCheckUtils]: 50: Hoare triple {9631#(<= |ULTIMATE.start_main_~x~0#1| 24)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9631#(<= |ULTIMATE.start_main_~x~0#1| 24)} is VALID [2022-02-21 03:36:36,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {9631#(<= |ULTIMATE.start_main_~x~0#1| 24)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9632#(<= |ULTIMATE.start_main_~x~0#1| 25)} is VALID [2022-02-21 03:36:36,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {9632#(<= |ULTIMATE.start_main_~x~0#1| 25)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9632#(<= |ULTIMATE.start_main_~x~0#1| 25)} is VALID [2022-02-21 03:36:36,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {9632#(<= |ULTIMATE.start_main_~x~0#1| 25)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9633#(<= |ULTIMATE.start_main_~x~0#1| 26)} is VALID [2022-02-21 03:36:36,595 INFO L290 TraceCheckUtils]: 54: Hoare triple {9633#(<= |ULTIMATE.start_main_~x~0#1| 26)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9633#(<= |ULTIMATE.start_main_~x~0#1| 26)} is VALID [2022-02-21 03:36:36,597 INFO L290 TraceCheckUtils]: 55: Hoare triple {9633#(<= |ULTIMATE.start_main_~x~0#1| 26)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9634#(<= |ULTIMATE.start_main_~x~0#1| 27)} is VALID [2022-02-21 03:36:36,597 INFO L290 TraceCheckUtils]: 56: Hoare triple {9634#(<= |ULTIMATE.start_main_~x~0#1| 27)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9634#(<= |ULTIMATE.start_main_~x~0#1| 27)} is VALID [2022-02-21 03:36:36,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {9634#(<= |ULTIMATE.start_main_~x~0#1| 27)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9635#(<= |ULTIMATE.start_main_~x~0#1| 28)} is VALID [2022-02-21 03:36:36,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {9635#(<= |ULTIMATE.start_main_~x~0#1| 28)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9635#(<= |ULTIMATE.start_main_~x~0#1| 28)} is VALID [2022-02-21 03:36:36,599 INFO L290 TraceCheckUtils]: 59: Hoare triple {9635#(<= |ULTIMATE.start_main_~x~0#1| 28)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9636#(<= |ULTIMATE.start_main_~x~0#1| 29)} is VALID [2022-02-21 03:36:36,599 INFO L290 TraceCheckUtils]: 60: Hoare triple {9636#(<= |ULTIMATE.start_main_~x~0#1| 29)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9636#(<= |ULTIMATE.start_main_~x~0#1| 29)} is VALID [2022-02-21 03:36:36,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {9636#(<= |ULTIMATE.start_main_~x~0#1| 29)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9637#(<= |ULTIMATE.start_main_~x~0#1| 30)} is VALID [2022-02-21 03:36:36,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {9637#(<= |ULTIMATE.start_main_~x~0#1| 30)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9637#(<= |ULTIMATE.start_main_~x~0#1| 30)} is VALID [2022-02-21 03:36:36,600 INFO L290 TraceCheckUtils]: 63: Hoare triple {9637#(<= |ULTIMATE.start_main_~x~0#1| 30)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9638#(<= |ULTIMATE.start_main_~x~0#1| 31)} is VALID [2022-02-21 03:36:36,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {9638#(<= |ULTIMATE.start_main_~x~0#1| 31)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9638#(<= |ULTIMATE.start_main_~x~0#1| 31)} is VALID [2022-02-21 03:36:36,601 INFO L290 TraceCheckUtils]: 65: Hoare triple {9638#(<= |ULTIMATE.start_main_~x~0#1| 31)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9639#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:36:36,601 INFO L290 TraceCheckUtils]: 66: Hoare triple {9639#(<= |ULTIMATE.start_main_~x~0#1| 32)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9639#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:36:36,602 INFO L290 TraceCheckUtils]: 67: Hoare triple {9639#(<= |ULTIMATE.start_main_~x~0#1| 32)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9640#(<= |ULTIMATE.start_main_~x~0#1| 33)} is VALID [2022-02-21 03:36:36,602 INFO L290 TraceCheckUtils]: 68: Hoare triple {9640#(<= |ULTIMATE.start_main_~x~0#1| 33)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9640#(<= |ULTIMATE.start_main_~x~0#1| 33)} is VALID [2022-02-21 03:36:36,602 INFO L290 TraceCheckUtils]: 69: Hoare triple {9640#(<= |ULTIMATE.start_main_~x~0#1| 33)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9641#(<= |ULTIMATE.start_main_~x~0#1| 34)} is VALID [2022-02-21 03:36:36,602 INFO L290 TraceCheckUtils]: 70: Hoare triple {9641#(<= |ULTIMATE.start_main_~x~0#1| 34)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9641#(<= |ULTIMATE.start_main_~x~0#1| 34)} is VALID [2022-02-21 03:36:36,603 INFO L290 TraceCheckUtils]: 71: Hoare triple {9641#(<= |ULTIMATE.start_main_~x~0#1| 34)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9642#(<= |ULTIMATE.start_main_~x~0#1| 35)} is VALID [2022-02-21 03:36:36,603 INFO L290 TraceCheckUtils]: 72: Hoare triple {9642#(<= |ULTIMATE.start_main_~x~0#1| 35)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9642#(<= |ULTIMATE.start_main_~x~0#1| 35)} is VALID [2022-02-21 03:36:36,603 INFO L290 TraceCheckUtils]: 73: Hoare triple {9642#(<= |ULTIMATE.start_main_~x~0#1| 35)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9643#(<= |ULTIMATE.start_main_~x~0#1| 36)} is VALID [2022-02-21 03:36:36,604 INFO L290 TraceCheckUtils]: 74: Hoare triple {9643#(<= |ULTIMATE.start_main_~x~0#1| 36)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9643#(<= |ULTIMATE.start_main_~x~0#1| 36)} is VALID [2022-02-21 03:36:36,604 INFO L290 TraceCheckUtils]: 75: Hoare triple {9643#(<= |ULTIMATE.start_main_~x~0#1| 36)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9644#(<= |ULTIMATE.start_main_~x~0#1| 37)} is VALID [2022-02-21 03:36:36,604 INFO L290 TraceCheckUtils]: 76: Hoare triple {9644#(<= |ULTIMATE.start_main_~x~0#1| 37)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9644#(<= |ULTIMATE.start_main_~x~0#1| 37)} is VALID [2022-02-21 03:36:36,605 INFO L290 TraceCheckUtils]: 77: Hoare triple {9644#(<= |ULTIMATE.start_main_~x~0#1| 37)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9645#(<= |ULTIMATE.start_main_~x~0#1| 38)} is VALID [2022-02-21 03:36:36,605 INFO L290 TraceCheckUtils]: 78: Hoare triple {9645#(<= |ULTIMATE.start_main_~x~0#1| 38)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9645#(<= |ULTIMATE.start_main_~x~0#1| 38)} is VALID [2022-02-21 03:36:36,605 INFO L290 TraceCheckUtils]: 79: Hoare triple {9645#(<= |ULTIMATE.start_main_~x~0#1| 38)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9646#(<= |ULTIMATE.start_main_~x~0#1| 39)} is VALID [2022-02-21 03:36:36,606 INFO L290 TraceCheckUtils]: 80: Hoare triple {9646#(<= |ULTIMATE.start_main_~x~0#1| 39)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9646#(<= |ULTIMATE.start_main_~x~0#1| 39)} is VALID [2022-02-21 03:36:36,606 INFO L290 TraceCheckUtils]: 81: Hoare triple {9646#(<= |ULTIMATE.start_main_~x~0#1| 39)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9647#(<= |ULTIMATE.start_main_~x~0#1| 40)} is VALID [2022-02-21 03:36:36,606 INFO L290 TraceCheckUtils]: 82: Hoare triple {9647#(<= |ULTIMATE.start_main_~x~0#1| 40)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9647#(<= |ULTIMATE.start_main_~x~0#1| 40)} is VALID [2022-02-21 03:36:36,607 INFO L290 TraceCheckUtils]: 83: Hoare triple {9647#(<= |ULTIMATE.start_main_~x~0#1| 40)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9648#(<= |ULTIMATE.start_main_~x~0#1| 41)} is VALID [2022-02-21 03:36:36,607 INFO L290 TraceCheckUtils]: 84: Hoare triple {9648#(<= |ULTIMATE.start_main_~x~0#1| 41)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9648#(<= |ULTIMATE.start_main_~x~0#1| 41)} is VALID [2022-02-21 03:36:36,607 INFO L290 TraceCheckUtils]: 85: Hoare triple {9648#(<= |ULTIMATE.start_main_~x~0#1| 41)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9649#(<= |ULTIMATE.start_main_~x~0#1| 42)} is VALID [2022-02-21 03:36:36,608 INFO L290 TraceCheckUtils]: 86: Hoare triple {9649#(<= |ULTIMATE.start_main_~x~0#1| 42)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9649#(<= |ULTIMATE.start_main_~x~0#1| 42)} is VALID [2022-02-21 03:36:36,608 INFO L290 TraceCheckUtils]: 87: Hoare triple {9649#(<= |ULTIMATE.start_main_~x~0#1| 42)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9650#(<= |ULTIMATE.start_main_~x~0#1| 43)} is VALID [2022-02-21 03:36:36,612 INFO L290 TraceCheckUtils]: 88: Hoare triple {9650#(<= |ULTIMATE.start_main_~x~0#1| 43)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9650#(<= |ULTIMATE.start_main_~x~0#1| 43)} is VALID [2022-02-21 03:36:36,612 INFO L290 TraceCheckUtils]: 89: Hoare triple {9650#(<= |ULTIMATE.start_main_~x~0#1| 43)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9651#(<= |ULTIMATE.start_main_~x~0#1| 44)} is VALID [2022-02-21 03:36:36,613 INFO L290 TraceCheckUtils]: 90: Hoare triple {9651#(<= |ULTIMATE.start_main_~x~0#1| 44)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9651#(<= |ULTIMATE.start_main_~x~0#1| 44)} is VALID [2022-02-21 03:36:36,614 INFO L290 TraceCheckUtils]: 91: Hoare triple {9651#(<= |ULTIMATE.start_main_~x~0#1| 44)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9652#(<= |ULTIMATE.start_main_~x~0#1| 45)} is VALID [2022-02-21 03:36:36,614 INFO L290 TraceCheckUtils]: 92: Hoare triple {9652#(<= |ULTIMATE.start_main_~x~0#1| 45)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9652#(<= |ULTIMATE.start_main_~x~0#1| 45)} is VALID [2022-02-21 03:36:36,614 INFO L290 TraceCheckUtils]: 93: Hoare triple {9652#(<= |ULTIMATE.start_main_~x~0#1| 45)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9653#(<= |ULTIMATE.start_main_~x~0#1| 46)} is VALID [2022-02-21 03:36:36,615 INFO L290 TraceCheckUtils]: 94: Hoare triple {9653#(<= |ULTIMATE.start_main_~x~0#1| 46)} assume !(main_~x~0#1 < 100000); {9606#false} is VALID [2022-02-21 03:36:36,615 INFO L290 TraceCheckUtils]: 95: Hoare triple {9606#false} main_~x~0#1 := 0; {9606#false} is VALID [2022-02-21 03:36:36,615 INFO L290 TraceCheckUtils]: 96: Hoare triple {9606#false} assume !(main_~x~0#1 < main_~n~0#1); {9606#false} is VALID [2022-02-21 03:36:36,615 INFO L290 TraceCheckUtils]: 97: Hoare triple {9606#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {9606#false} is VALID [2022-02-21 03:36:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:36,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:36,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935235778] [2022-02-21 03:36:36,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935235778] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:36,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726903790] [2022-02-21 03:36:36,617 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:36:36,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:36,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:36,618 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:36,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-21 03:36:36,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:36:36,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:36,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-21 03:36:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:36,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:37,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {9605#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {9605#true} is VALID [2022-02-21 03:36:37,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {9605#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {9660#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:37,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {9660#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9660#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:37,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {9660#(<= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9608#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:37,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {9608#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9608#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:37,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {9608#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9609#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:37,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {9609#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9609#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:37,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {9609#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9610#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:37,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {9610#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9610#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:37,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {9610#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9611#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:37,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {9611#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9611#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:37,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {9611#(<= |ULTIMATE.start_main_~x~0#1| 4)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9612#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:36:37,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {9612#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9612#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:36:37,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {9612#(<= |ULTIMATE.start_main_~x~0#1| 5)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9613#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:36:37,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {9613#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9613#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:36:37,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {9613#(<= |ULTIMATE.start_main_~x~0#1| 6)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9614#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:36:37,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {9614#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9614#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:36:37,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {9614#(<= |ULTIMATE.start_main_~x~0#1| 7)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9615#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:36:37,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {9615#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9615#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:36:37,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {9615#(<= |ULTIMATE.start_main_~x~0#1| 8)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9616#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:36:37,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {9616#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9616#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:36:37,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {9616#(<= |ULTIMATE.start_main_~x~0#1| 9)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9617#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:36:37,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {9617#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9617#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:36:37,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {9617#(<= |ULTIMATE.start_main_~x~0#1| 10)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9618#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:36:37,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {9618#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9618#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:36:37,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {9618#(<= |ULTIMATE.start_main_~x~0#1| 11)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9619#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-21 03:36:37,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {9619#(<= |ULTIMATE.start_main_~x~0#1| 12)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9619#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-21 03:36:37,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {9619#(<= |ULTIMATE.start_main_~x~0#1| 12)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9620#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-21 03:36:37,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {9620#(<= |ULTIMATE.start_main_~x~0#1| 13)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9620#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-21 03:36:37,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {9620#(<= |ULTIMATE.start_main_~x~0#1| 13)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9621#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-21 03:36:37,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {9621#(<= |ULTIMATE.start_main_~x~0#1| 14)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9621#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-21 03:36:37,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {9621#(<= |ULTIMATE.start_main_~x~0#1| 14)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9622#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-21 03:36:37,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {9622#(<= |ULTIMATE.start_main_~x~0#1| 15)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9622#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-21 03:36:37,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {9622#(<= |ULTIMATE.start_main_~x~0#1| 15)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9623#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:36:37,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {9623#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9623#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:36:37,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {9623#(<= |ULTIMATE.start_main_~x~0#1| 16)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9624#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-21 03:36:37,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {9624#(<= |ULTIMATE.start_main_~x~0#1| 17)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9624#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-21 03:36:37,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {9624#(<= |ULTIMATE.start_main_~x~0#1| 17)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9625#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-21 03:36:37,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {9625#(<= |ULTIMATE.start_main_~x~0#1| 18)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9625#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-21 03:36:37,459 INFO L290 TraceCheckUtils]: 39: Hoare triple {9625#(<= |ULTIMATE.start_main_~x~0#1| 18)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9626#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-21 03:36:37,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {9626#(<= |ULTIMATE.start_main_~x~0#1| 19)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9626#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-21 03:36:37,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {9626#(<= |ULTIMATE.start_main_~x~0#1| 19)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9627#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-21 03:36:37,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {9627#(<= |ULTIMATE.start_main_~x~0#1| 20)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9627#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-21 03:36:37,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {9627#(<= |ULTIMATE.start_main_~x~0#1| 20)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9628#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-21 03:36:37,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {9628#(<= |ULTIMATE.start_main_~x~0#1| 21)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9628#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-21 03:36:37,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {9628#(<= |ULTIMATE.start_main_~x~0#1| 21)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9629#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-21 03:36:37,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {9629#(<= |ULTIMATE.start_main_~x~0#1| 22)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9629#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-21 03:36:37,462 INFO L290 TraceCheckUtils]: 47: Hoare triple {9629#(<= |ULTIMATE.start_main_~x~0#1| 22)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9630#(<= |ULTIMATE.start_main_~x~0#1| 23)} is VALID [2022-02-21 03:36:37,462 INFO L290 TraceCheckUtils]: 48: Hoare triple {9630#(<= |ULTIMATE.start_main_~x~0#1| 23)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9630#(<= |ULTIMATE.start_main_~x~0#1| 23)} is VALID [2022-02-21 03:36:37,462 INFO L290 TraceCheckUtils]: 49: Hoare triple {9630#(<= |ULTIMATE.start_main_~x~0#1| 23)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9631#(<= |ULTIMATE.start_main_~x~0#1| 24)} is VALID [2022-02-21 03:36:37,463 INFO L290 TraceCheckUtils]: 50: Hoare triple {9631#(<= |ULTIMATE.start_main_~x~0#1| 24)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9631#(<= |ULTIMATE.start_main_~x~0#1| 24)} is VALID [2022-02-21 03:36:37,463 INFO L290 TraceCheckUtils]: 51: Hoare triple {9631#(<= |ULTIMATE.start_main_~x~0#1| 24)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9632#(<= |ULTIMATE.start_main_~x~0#1| 25)} is VALID [2022-02-21 03:36:37,463 INFO L290 TraceCheckUtils]: 52: Hoare triple {9632#(<= |ULTIMATE.start_main_~x~0#1| 25)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9632#(<= |ULTIMATE.start_main_~x~0#1| 25)} is VALID [2022-02-21 03:36:37,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {9632#(<= |ULTIMATE.start_main_~x~0#1| 25)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9633#(<= |ULTIMATE.start_main_~x~0#1| 26)} is VALID [2022-02-21 03:36:37,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {9633#(<= |ULTIMATE.start_main_~x~0#1| 26)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9633#(<= |ULTIMATE.start_main_~x~0#1| 26)} is VALID [2022-02-21 03:36:37,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {9633#(<= |ULTIMATE.start_main_~x~0#1| 26)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9634#(<= |ULTIMATE.start_main_~x~0#1| 27)} is VALID [2022-02-21 03:36:37,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {9634#(<= |ULTIMATE.start_main_~x~0#1| 27)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9634#(<= |ULTIMATE.start_main_~x~0#1| 27)} is VALID [2022-02-21 03:36:37,465 INFO L290 TraceCheckUtils]: 57: Hoare triple {9634#(<= |ULTIMATE.start_main_~x~0#1| 27)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9635#(<= |ULTIMATE.start_main_~x~0#1| 28)} is VALID [2022-02-21 03:36:37,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {9635#(<= |ULTIMATE.start_main_~x~0#1| 28)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9635#(<= |ULTIMATE.start_main_~x~0#1| 28)} is VALID [2022-02-21 03:36:37,465 INFO L290 TraceCheckUtils]: 59: Hoare triple {9635#(<= |ULTIMATE.start_main_~x~0#1| 28)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9636#(<= |ULTIMATE.start_main_~x~0#1| 29)} is VALID [2022-02-21 03:36:37,466 INFO L290 TraceCheckUtils]: 60: Hoare triple {9636#(<= |ULTIMATE.start_main_~x~0#1| 29)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9636#(<= |ULTIMATE.start_main_~x~0#1| 29)} is VALID [2022-02-21 03:36:37,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {9636#(<= |ULTIMATE.start_main_~x~0#1| 29)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9637#(<= |ULTIMATE.start_main_~x~0#1| 30)} is VALID [2022-02-21 03:36:37,466 INFO L290 TraceCheckUtils]: 62: Hoare triple {9637#(<= |ULTIMATE.start_main_~x~0#1| 30)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9637#(<= |ULTIMATE.start_main_~x~0#1| 30)} is VALID [2022-02-21 03:36:37,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {9637#(<= |ULTIMATE.start_main_~x~0#1| 30)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9638#(<= |ULTIMATE.start_main_~x~0#1| 31)} is VALID [2022-02-21 03:36:37,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {9638#(<= |ULTIMATE.start_main_~x~0#1| 31)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9638#(<= |ULTIMATE.start_main_~x~0#1| 31)} is VALID [2022-02-21 03:36:37,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {9638#(<= |ULTIMATE.start_main_~x~0#1| 31)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9639#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:36:37,468 INFO L290 TraceCheckUtils]: 66: Hoare triple {9639#(<= |ULTIMATE.start_main_~x~0#1| 32)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9639#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:36:37,468 INFO L290 TraceCheckUtils]: 67: Hoare triple {9639#(<= |ULTIMATE.start_main_~x~0#1| 32)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9640#(<= |ULTIMATE.start_main_~x~0#1| 33)} is VALID [2022-02-21 03:36:37,468 INFO L290 TraceCheckUtils]: 68: Hoare triple {9640#(<= |ULTIMATE.start_main_~x~0#1| 33)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9640#(<= |ULTIMATE.start_main_~x~0#1| 33)} is VALID [2022-02-21 03:36:37,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {9640#(<= |ULTIMATE.start_main_~x~0#1| 33)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9641#(<= |ULTIMATE.start_main_~x~0#1| 34)} is VALID [2022-02-21 03:36:37,469 INFO L290 TraceCheckUtils]: 70: Hoare triple {9641#(<= |ULTIMATE.start_main_~x~0#1| 34)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9641#(<= |ULTIMATE.start_main_~x~0#1| 34)} is VALID [2022-02-21 03:36:37,469 INFO L290 TraceCheckUtils]: 71: Hoare triple {9641#(<= |ULTIMATE.start_main_~x~0#1| 34)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9642#(<= |ULTIMATE.start_main_~x~0#1| 35)} is VALID [2022-02-21 03:36:37,469 INFO L290 TraceCheckUtils]: 72: Hoare triple {9642#(<= |ULTIMATE.start_main_~x~0#1| 35)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9642#(<= |ULTIMATE.start_main_~x~0#1| 35)} is VALID [2022-02-21 03:36:37,470 INFO L290 TraceCheckUtils]: 73: Hoare triple {9642#(<= |ULTIMATE.start_main_~x~0#1| 35)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9643#(<= |ULTIMATE.start_main_~x~0#1| 36)} is VALID [2022-02-21 03:36:37,470 INFO L290 TraceCheckUtils]: 74: Hoare triple {9643#(<= |ULTIMATE.start_main_~x~0#1| 36)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9643#(<= |ULTIMATE.start_main_~x~0#1| 36)} is VALID [2022-02-21 03:36:37,470 INFO L290 TraceCheckUtils]: 75: Hoare triple {9643#(<= |ULTIMATE.start_main_~x~0#1| 36)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9644#(<= |ULTIMATE.start_main_~x~0#1| 37)} is VALID [2022-02-21 03:36:37,471 INFO L290 TraceCheckUtils]: 76: Hoare triple {9644#(<= |ULTIMATE.start_main_~x~0#1| 37)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9644#(<= |ULTIMATE.start_main_~x~0#1| 37)} is VALID [2022-02-21 03:36:37,471 INFO L290 TraceCheckUtils]: 77: Hoare triple {9644#(<= |ULTIMATE.start_main_~x~0#1| 37)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9645#(<= |ULTIMATE.start_main_~x~0#1| 38)} is VALID [2022-02-21 03:36:37,471 INFO L290 TraceCheckUtils]: 78: Hoare triple {9645#(<= |ULTIMATE.start_main_~x~0#1| 38)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9645#(<= |ULTIMATE.start_main_~x~0#1| 38)} is VALID [2022-02-21 03:36:37,472 INFO L290 TraceCheckUtils]: 79: Hoare triple {9645#(<= |ULTIMATE.start_main_~x~0#1| 38)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9646#(<= |ULTIMATE.start_main_~x~0#1| 39)} is VALID [2022-02-21 03:36:37,472 INFO L290 TraceCheckUtils]: 80: Hoare triple {9646#(<= |ULTIMATE.start_main_~x~0#1| 39)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9646#(<= |ULTIMATE.start_main_~x~0#1| 39)} is VALID [2022-02-21 03:36:37,472 INFO L290 TraceCheckUtils]: 81: Hoare triple {9646#(<= |ULTIMATE.start_main_~x~0#1| 39)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9647#(<= |ULTIMATE.start_main_~x~0#1| 40)} is VALID [2022-02-21 03:36:37,472 INFO L290 TraceCheckUtils]: 82: Hoare triple {9647#(<= |ULTIMATE.start_main_~x~0#1| 40)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9647#(<= |ULTIMATE.start_main_~x~0#1| 40)} is VALID [2022-02-21 03:36:37,473 INFO L290 TraceCheckUtils]: 83: Hoare triple {9647#(<= |ULTIMATE.start_main_~x~0#1| 40)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9648#(<= |ULTIMATE.start_main_~x~0#1| 41)} is VALID [2022-02-21 03:36:37,473 INFO L290 TraceCheckUtils]: 84: Hoare triple {9648#(<= |ULTIMATE.start_main_~x~0#1| 41)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9648#(<= |ULTIMATE.start_main_~x~0#1| 41)} is VALID [2022-02-21 03:36:37,473 INFO L290 TraceCheckUtils]: 85: Hoare triple {9648#(<= |ULTIMATE.start_main_~x~0#1| 41)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9649#(<= |ULTIMATE.start_main_~x~0#1| 42)} is VALID [2022-02-21 03:36:37,474 INFO L290 TraceCheckUtils]: 86: Hoare triple {9649#(<= |ULTIMATE.start_main_~x~0#1| 42)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9649#(<= |ULTIMATE.start_main_~x~0#1| 42)} is VALID [2022-02-21 03:36:37,474 INFO L290 TraceCheckUtils]: 87: Hoare triple {9649#(<= |ULTIMATE.start_main_~x~0#1| 42)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9650#(<= |ULTIMATE.start_main_~x~0#1| 43)} is VALID [2022-02-21 03:36:37,474 INFO L290 TraceCheckUtils]: 88: Hoare triple {9650#(<= |ULTIMATE.start_main_~x~0#1| 43)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9650#(<= |ULTIMATE.start_main_~x~0#1| 43)} is VALID [2022-02-21 03:36:37,475 INFO L290 TraceCheckUtils]: 89: Hoare triple {9650#(<= |ULTIMATE.start_main_~x~0#1| 43)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9651#(<= |ULTIMATE.start_main_~x~0#1| 44)} is VALID [2022-02-21 03:36:37,475 INFO L290 TraceCheckUtils]: 90: Hoare triple {9651#(<= |ULTIMATE.start_main_~x~0#1| 44)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9651#(<= |ULTIMATE.start_main_~x~0#1| 44)} is VALID [2022-02-21 03:36:37,475 INFO L290 TraceCheckUtils]: 91: Hoare triple {9651#(<= |ULTIMATE.start_main_~x~0#1| 44)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9652#(<= |ULTIMATE.start_main_~x~0#1| 45)} is VALID [2022-02-21 03:36:37,475 INFO L290 TraceCheckUtils]: 92: Hoare triple {9652#(<= |ULTIMATE.start_main_~x~0#1| 45)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9652#(<= |ULTIMATE.start_main_~x~0#1| 45)} is VALID [2022-02-21 03:36:37,476 INFO L290 TraceCheckUtils]: 93: Hoare triple {9652#(<= |ULTIMATE.start_main_~x~0#1| 45)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9653#(<= |ULTIMATE.start_main_~x~0#1| 46)} is VALID [2022-02-21 03:36:37,476 INFO L290 TraceCheckUtils]: 94: Hoare triple {9653#(<= |ULTIMATE.start_main_~x~0#1| 46)} assume !(main_~x~0#1 < 100000); {9606#false} is VALID [2022-02-21 03:36:37,476 INFO L290 TraceCheckUtils]: 95: Hoare triple {9606#false} main_~x~0#1 := 0; {9606#false} is VALID [2022-02-21 03:36:37,476 INFO L290 TraceCheckUtils]: 96: Hoare triple {9606#false} assume !(main_~x~0#1 < main_~n~0#1); {9606#false} is VALID [2022-02-21 03:36:37,476 INFO L290 TraceCheckUtils]: 97: Hoare triple {9606#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {9606#false} is VALID [2022-02-21 03:36:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:37,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:40,286 INFO L290 TraceCheckUtils]: 97: Hoare triple {9606#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {9606#false} is VALID [2022-02-21 03:36:40,287 INFO L290 TraceCheckUtils]: 96: Hoare triple {9606#false} assume !(main_~x~0#1 < main_~n~0#1); {9606#false} is VALID [2022-02-21 03:36:40,287 INFO L290 TraceCheckUtils]: 95: Hoare triple {9606#false} main_~x~0#1 := 0; {9606#false} is VALID [2022-02-21 03:36:40,287 INFO L290 TraceCheckUtils]: 94: Hoare triple {9958#(< |ULTIMATE.start_main_~x~0#1| 100000)} assume !(main_~x~0#1 < 100000); {9606#false} is VALID [2022-02-21 03:36:40,287 INFO L290 TraceCheckUtils]: 93: Hoare triple {9962#(< |ULTIMATE.start_main_~x~0#1| 99999)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9958#(< |ULTIMATE.start_main_~x~0#1| 100000)} is VALID [2022-02-21 03:36:40,288 INFO L290 TraceCheckUtils]: 92: Hoare triple {9962#(< |ULTIMATE.start_main_~x~0#1| 99999)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9962#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-21 03:36:40,288 INFO L290 TraceCheckUtils]: 91: Hoare triple {9969#(< |ULTIMATE.start_main_~x~0#1| 99998)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9962#(< |ULTIMATE.start_main_~x~0#1| 99999)} is VALID [2022-02-21 03:36:40,288 INFO L290 TraceCheckUtils]: 90: Hoare triple {9969#(< |ULTIMATE.start_main_~x~0#1| 99998)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9969#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-21 03:36:40,289 INFO L290 TraceCheckUtils]: 89: Hoare triple {9976#(< |ULTIMATE.start_main_~x~0#1| 99997)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9969#(< |ULTIMATE.start_main_~x~0#1| 99998)} is VALID [2022-02-21 03:36:40,289 INFO L290 TraceCheckUtils]: 88: Hoare triple {9976#(< |ULTIMATE.start_main_~x~0#1| 99997)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9976#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-21 03:36:40,289 INFO L290 TraceCheckUtils]: 87: Hoare triple {9983#(< |ULTIMATE.start_main_~x~0#1| 99996)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9976#(< |ULTIMATE.start_main_~x~0#1| 99997)} is VALID [2022-02-21 03:36:40,289 INFO L290 TraceCheckUtils]: 86: Hoare triple {9983#(< |ULTIMATE.start_main_~x~0#1| 99996)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9983#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-21 03:36:40,290 INFO L290 TraceCheckUtils]: 85: Hoare triple {9990#(< |ULTIMATE.start_main_~x~0#1| 99995)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9983#(< |ULTIMATE.start_main_~x~0#1| 99996)} is VALID [2022-02-21 03:36:40,290 INFO L290 TraceCheckUtils]: 84: Hoare triple {9990#(< |ULTIMATE.start_main_~x~0#1| 99995)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9990#(< |ULTIMATE.start_main_~x~0#1| 99995)} is VALID [2022-02-21 03:36:40,290 INFO L290 TraceCheckUtils]: 83: Hoare triple {9997#(< |ULTIMATE.start_main_~x~0#1| 99994)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9990#(< |ULTIMATE.start_main_~x~0#1| 99995)} is VALID [2022-02-21 03:36:40,291 INFO L290 TraceCheckUtils]: 82: Hoare triple {9997#(< |ULTIMATE.start_main_~x~0#1| 99994)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {9997#(< |ULTIMATE.start_main_~x~0#1| 99994)} is VALID [2022-02-21 03:36:40,291 INFO L290 TraceCheckUtils]: 81: Hoare triple {10004#(< |ULTIMATE.start_main_~x~0#1| 99993)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {9997#(< |ULTIMATE.start_main_~x~0#1| 99994)} is VALID [2022-02-21 03:36:40,291 INFO L290 TraceCheckUtils]: 80: Hoare triple {10004#(< |ULTIMATE.start_main_~x~0#1| 99993)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10004#(< |ULTIMATE.start_main_~x~0#1| 99993)} is VALID [2022-02-21 03:36:40,292 INFO L290 TraceCheckUtils]: 79: Hoare triple {10011#(< |ULTIMATE.start_main_~x~0#1| 99992)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10004#(< |ULTIMATE.start_main_~x~0#1| 99993)} is VALID [2022-02-21 03:36:40,292 INFO L290 TraceCheckUtils]: 78: Hoare triple {10011#(< |ULTIMATE.start_main_~x~0#1| 99992)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10011#(< |ULTIMATE.start_main_~x~0#1| 99992)} is VALID [2022-02-21 03:36:40,292 INFO L290 TraceCheckUtils]: 77: Hoare triple {10018#(< |ULTIMATE.start_main_~x~0#1| 99991)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10011#(< |ULTIMATE.start_main_~x~0#1| 99992)} is VALID [2022-02-21 03:36:40,293 INFO L290 TraceCheckUtils]: 76: Hoare triple {10018#(< |ULTIMATE.start_main_~x~0#1| 99991)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10018#(< |ULTIMATE.start_main_~x~0#1| 99991)} is VALID [2022-02-21 03:36:40,293 INFO L290 TraceCheckUtils]: 75: Hoare triple {10025#(< |ULTIMATE.start_main_~x~0#1| 99990)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10018#(< |ULTIMATE.start_main_~x~0#1| 99991)} is VALID [2022-02-21 03:36:40,293 INFO L290 TraceCheckUtils]: 74: Hoare triple {10025#(< |ULTIMATE.start_main_~x~0#1| 99990)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10025#(< |ULTIMATE.start_main_~x~0#1| 99990)} is VALID [2022-02-21 03:36:40,294 INFO L290 TraceCheckUtils]: 73: Hoare triple {10032#(< |ULTIMATE.start_main_~x~0#1| 99989)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10025#(< |ULTIMATE.start_main_~x~0#1| 99990)} is VALID [2022-02-21 03:36:40,294 INFO L290 TraceCheckUtils]: 72: Hoare triple {10032#(< |ULTIMATE.start_main_~x~0#1| 99989)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10032#(< |ULTIMATE.start_main_~x~0#1| 99989)} is VALID [2022-02-21 03:36:40,294 INFO L290 TraceCheckUtils]: 71: Hoare triple {10039#(< |ULTIMATE.start_main_~x~0#1| 99988)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10032#(< |ULTIMATE.start_main_~x~0#1| 99989)} is VALID [2022-02-21 03:36:40,294 INFO L290 TraceCheckUtils]: 70: Hoare triple {10039#(< |ULTIMATE.start_main_~x~0#1| 99988)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10039#(< |ULTIMATE.start_main_~x~0#1| 99988)} is VALID [2022-02-21 03:36:40,295 INFO L290 TraceCheckUtils]: 69: Hoare triple {10046#(< |ULTIMATE.start_main_~x~0#1| 99987)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10039#(< |ULTIMATE.start_main_~x~0#1| 99988)} is VALID [2022-02-21 03:36:40,295 INFO L290 TraceCheckUtils]: 68: Hoare triple {10046#(< |ULTIMATE.start_main_~x~0#1| 99987)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10046#(< |ULTIMATE.start_main_~x~0#1| 99987)} is VALID [2022-02-21 03:36:40,295 INFO L290 TraceCheckUtils]: 67: Hoare triple {10053#(< |ULTIMATE.start_main_~x~0#1| 99986)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10046#(< |ULTIMATE.start_main_~x~0#1| 99987)} is VALID [2022-02-21 03:36:40,296 INFO L290 TraceCheckUtils]: 66: Hoare triple {10053#(< |ULTIMATE.start_main_~x~0#1| 99986)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10053#(< |ULTIMATE.start_main_~x~0#1| 99986)} is VALID [2022-02-21 03:36:40,296 INFO L290 TraceCheckUtils]: 65: Hoare triple {10060#(< |ULTIMATE.start_main_~x~0#1| 99985)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10053#(< |ULTIMATE.start_main_~x~0#1| 99986)} is VALID [2022-02-21 03:36:40,296 INFO L290 TraceCheckUtils]: 64: Hoare triple {10060#(< |ULTIMATE.start_main_~x~0#1| 99985)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10060#(< |ULTIMATE.start_main_~x~0#1| 99985)} is VALID [2022-02-21 03:36:40,297 INFO L290 TraceCheckUtils]: 63: Hoare triple {10067#(< |ULTIMATE.start_main_~x~0#1| 99984)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10060#(< |ULTIMATE.start_main_~x~0#1| 99985)} is VALID [2022-02-21 03:36:40,297 INFO L290 TraceCheckUtils]: 62: Hoare triple {10067#(< |ULTIMATE.start_main_~x~0#1| 99984)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10067#(< |ULTIMATE.start_main_~x~0#1| 99984)} is VALID [2022-02-21 03:36:40,297 INFO L290 TraceCheckUtils]: 61: Hoare triple {10074#(< |ULTIMATE.start_main_~x~0#1| 99983)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10067#(< |ULTIMATE.start_main_~x~0#1| 99984)} is VALID [2022-02-21 03:36:40,297 INFO L290 TraceCheckUtils]: 60: Hoare triple {10074#(< |ULTIMATE.start_main_~x~0#1| 99983)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10074#(< |ULTIMATE.start_main_~x~0#1| 99983)} is VALID [2022-02-21 03:36:40,298 INFO L290 TraceCheckUtils]: 59: Hoare triple {10081#(< |ULTIMATE.start_main_~x~0#1| 99982)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10074#(< |ULTIMATE.start_main_~x~0#1| 99983)} is VALID [2022-02-21 03:36:40,298 INFO L290 TraceCheckUtils]: 58: Hoare triple {10081#(< |ULTIMATE.start_main_~x~0#1| 99982)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10081#(< |ULTIMATE.start_main_~x~0#1| 99982)} is VALID [2022-02-21 03:36:40,298 INFO L290 TraceCheckUtils]: 57: Hoare triple {10088#(< |ULTIMATE.start_main_~x~0#1| 99981)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10081#(< |ULTIMATE.start_main_~x~0#1| 99982)} is VALID [2022-02-21 03:36:40,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {10088#(< |ULTIMATE.start_main_~x~0#1| 99981)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10088#(< |ULTIMATE.start_main_~x~0#1| 99981)} is VALID [2022-02-21 03:36:40,299 INFO L290 TraceCheckUtils]: 55: Hoare triple {10095#(< |ULTIMATE.start_main_~x~0#1| 99980)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10088#(< |ULTIMATE.start_main_~x~0#1| 99981)} is VALID [2022-02-21 03:36:40,299 INFO L290 TraceCheckUtils]: 54: Hoare triple {10095#(< |ULTIMATE.start_main_~x~0#1| 99980)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10095#(< |ULTIMATE.start_main_~x~0#1| 99980)} is VALID [2022-02-21 03:36:40,300 INFO L290 TraceCheckUtils]: 53: Hoare triple {10102#(< |ULTIMATE.start_main_~x~0#1| 99979)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10095#(< |ULTIMATE.start_main_~x~0#1| 99980)} is VALID [2022-02-21 03:36:40,300 INFO L290 TraceCheckUtils]: 52: Hoare triple {10102#(< |ULTIMATE.start_main_~x~0#1| 99979)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10102#(< |ULTIMATE.start_main_~x~0#1| 99979)} is VALID [2022-02-21 03:36:40,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {10109#(< |ULTIMATE.start_main_~x~0#1| 99978)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10102#(< |ULTIMATE.start_main_~x~0#1| 99979)} is VALID [2022-02-21 03:36:40,301 INFO L290 TraceCheckUtils]: 50: Hoare triple {10109#(< |ULTIMATE.start_main_~x~0#1| 99978)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10109#(< |ULTIMATE.start_main_~x~0#1| 99978)} is VALID [2022-02-21 03:36:40,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {10116#(< |ULTIMATE.start_main_~x~0#1| 99977)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10109#(< |ULTIMATE.start_main_~x~0#1| 99978)} is VALID [2022-02-21 03:36:40,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {10116#(< |ULTIMATE.start_main_~x~0#1| 99977)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10116#(< |ULTIMATE.start_main_~x~0#1| 99977)} is VALID [2022-02-21 03:36:40,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {10123#(< |ULTIMATE.start_main_~x~0#1| 99976)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10116#(< |ULTIMATE.start_main_~x~0#1| 99977)} is VALID [2022-02-21 03:36:40,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {10123#(< |ULTIMATE.start_main_~x~0#1| 99976)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10123#(< |ULTIMATE.start_main_~x~0#1| 99976)} is VALID [2022-02-21 03:36:40,303 INFO L290 TraceCheckUtils]: 45: Hoare triple {10130#(< |ULTIMATE.start_main_~x~0#1| 99975)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10123#(< |ULTIMATE.start_main_~x~0#1| 99976)} is VALID [2022-02-21 03:36:40,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {10130#(< |ULTIMATE.start_main_~x~0#1| 99975)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10130#(< |ULTIMATE.start_main_~x~0#1| 99975)} is VALID [2022-02-21 03:36:40,303 INFO L290 TraceCheckUtils]: 43: Hoare triple {10137#(< |ULTIMATE.start_main_~x~0#1| 99974)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10130#(< |ULTIMATE.start_main_~x~0#1| 99975)} is VALID [2022-02-21 03:36:40,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {10137#(< |ULTIMATE.start_main_~x~0#1| 99974)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10137#(< |ULTIMATE.start_main_~x~0#1| 99974)} is VALID [2022-02-21 03:36:40,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {10144#(< |ULTIMATE.start_main_~x~0#1| 99973)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10137#(< |ULTIMATE.start_main_~x~0#1| 99974)} is VALID [2022-02-21 03:36:40,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {10144#(< |ULTIMATE.start_main_~x~0#1| 99973)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10144#(< |ULTIMATE.start_main_~x~0#1| 99973)} is VALID [2022-02-21 03:36:40,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {10151#(< |ULTIMATE.start_main_~x~0#1| 99972)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10144#(< |ULTIMATE.start_main_~x~0#1| 99973)} is VALID [2022-02-21 03:36:40,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {10151#(< |ULTIMATE.start_main_~x~0#1| 99972)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10151#(< |ULTIMATE.start_main_~x~0#1| 99972)} is VALID [2022-02-21 03:36:40,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {10158#(< |ULTIMATE.start_main_~x~0#1| 99971)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10151#(< |ULTIMATE.start_main_~x~0#1| 99972)} is VALID [2022-02-21 03:36:40,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {10158#(< |ULTIMATE.start_main_~x~0#1| 99971)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10158#(< |ULTIMATE.start_main_~x~0#1| 99971)} is VALID [2022-02-21 03:36:40,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {10165#(< |ULTIMATE.start_main_~x~0#1| 99970)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10158#(< |ULTIMATE.start_main_~x~0#1| 99971)} is VALID [2022-02-21 03:36:40,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {10165#(< |ULTIMATE.start_main_~x~0#1| 99970)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10165#(< |ULTIMATE.start_main_~x~0#1| 99970)} is VALID [2022-02-21 03:36:40,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {10172#(< |ULTIMATE.start_main_~x~0#1| 99969)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10165#(< |ULTIMATE.start_main_~x~0#1| 99970)} is VALID [2022-02-21 03:36:40,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {10172#(< |ULTIMATE.start_main_~x~0#1| 99969)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10172#(< |ULTIMATE.start_main_~x~0#1| 99969)} is VALID [2022-02-21 03:36:40,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {10179#(< |ULTIMATE.start_main_~x~0#1| 99968)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10172#(< |ULTIMATE.start_main_~x~0#1| 99969)} is VALID [2022-02-21 03:36:40,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {10179#(< |ULTIMATE.start_main_~x~0#1| 99968)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10179#(< |ULTIMATE.start_main_~x~0#1| 99968)} is VALID [2022-02-21 03:36:40,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {10186#(< |ULTIMATE.start_main_~x~0#1| 99967)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10179#(< |ULTIMATE.start_main_~x~0#1| 99968)} is VALID [2022-02-21 03:36:40,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {10186#(< |ULTIMATE.start_main_~x~0#1| 99967)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10186#(< |ULTIMATE.start_main_~x~0#1| 99967)} is VALID [2022-02-21 03:36:40,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {10193#(< |ULTIMATE.start_main_~x~0#1| 99966)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10186#(< |ULTIMATE.start_main_~x~0#1| 99967)} is VALID [2022-02-21 03:36:40,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {10193#(< |ULTIMATE.start_main_~x~0#1| 99966)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10193#(< |ULTIMATE.start_main_~x~0#1| 99966)} is VALID [2022-02-21 03:36:40,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {10200#(< |ULTIMATE.start_main_~x~0#1| 99965)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10193#(< |ULTIMATE.start_main_~x~0#1| 99966)} is VALID [2022-02-21 03:36:40,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {10200#(< |ULTIMATE.start_main_~x~0#1| 99965)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10200#(< |ULTIMATE.start_main_~x~0#1| 99965)} is VALID [2022-02-21 03:36:40,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {10207#(< |ULTIMATE.start_main_~x~0#1| 99964)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10200#(< |ULTIMATE.start_main_~x~0#1| 99965)} is VALID [2022-02-21 03:36:40,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {10207#(< |ULTIMATE.start_main_~x~0#1| 99964)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10207#(< |ULTIMATE.start_main_~x~0#1| 99964)} is VALID [2022-02-21 03:36:40,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {10214#(< |ULTIMATE.start_main_~x~0#1| 99963)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10207#(< |ULTIMATE.start_main_~x~0#1| 99964)} is VALID [2022-02-21 03:36:40,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {10214#(< |ULTIMATE.start_main_~x~0#1| 99963)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10214#(< |ULTIMATE.start_main_~x~0#1| 99963)} is VALID [2022-02-21 03:36:40,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {10221#(< |ULTIMATE.start_main_~x~0#1| 99962)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10214#(< |ULTIMATE.start_main_~x~0#1| 99963)} is VALID [2022-02-21 03:36:40,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {10221#(< |ULTIMATE.start_main_~x~0#1| 99962)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10221#(< |ULTIMATE.start_main_~x~0#1| 99962)} is VALID [2022-02-21 03:36:40,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {10228#(< |ULTIMATE.start_main_~x~0#1| 99961)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10221#(< |ULTIMATE.start_main_~x~0#1| 99962)} is VALID [2022-02-21 03:36:40,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {10228#(< |ULTIMATE.start_main_~x~0#1| 99961)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10228#(< |ULTIMATE.start_main_~x~0#1| 99961)} is VALID [2022-02-21 03:36:40,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {10235#(< |ULTIMATE.start_main_~x~0#1| 99960)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10228#(< |ULTIMATE.start_main_~x~0#1| 99961)} is VALID [2022-02-21 03:36:40,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {10235#(< |ULTIMATE.start_main_~x~0#1| 99960)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10235#(< |ULTIMATE.start_main_~x~0#1| 99960)} is VALID [2022-02-21 03:36:40,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {10242#(< |ULTIMATE.start_main_~x~0#1| 99959)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10235#(< |ULTIMATE.start_main_~x~0#1| 99960)} is VALID [2022-02-21 03:36:40,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {10242#(< |ULTIMATE.start_main_~x~0#1| 99959)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10242#(< |ULTIMATE.start_main_~x~0#1| 99959)} is VALID [2022-02-21 03:36:40,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {10249#(< |ULTIMATE.start_main_~x~0#1| 99958)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10242#(< |ULTIMATE.start_main_~x~0#1| 99959)} is VALID [2022-02-21 03:36:40,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {10249#(< |ULTIMATE.start_main_~x~0#1| 99958)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10249#(< |ULTIMATE.start_main_~x~0#1| 99958)} is VALID [2022-02-21 03:36:40,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {10256#(< |ULTIMATE.start_main_~x~0#1| 99957)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10249#(< |ULTIMATE.start_main_~x~0#1| 99958)} is VALID [2022-02-21 03:36:40,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {10256#(< |ULTIMATE.start_main_~x~0#1| 99957)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10256#(< |ULTIMATE.start_main_~x~0#1| 99957)} is VALID [2022-02-21 03:36:40,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {10263#(< |ULTIMATE.start_main_~x~0#1| 99956)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10256#(< |ULTIMATE.start_main_~x~0#1| 99957)} is VALID [2022-02-21 03:36:40,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {10263#(< |ULTIMATE.start_main_~x~0#1| 99956)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10263#(< |ULTIMATE.start_main_~x~0#1| 99956)} is VALID [2022-02-21 03:36:40,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {10270#(< |ULTIMATE.start_main_~x~0#1| 99955)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10263#(< |ULTIMATE.start_main_~x~0#1| 99956)} is VALID [2022-02-21 03:36:40,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {10270#(< |ULTIMATE.start_main_~x~0#1| 99955)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10270#(< |ULTIMATE.start_main_~x~0#1| 99955)} is VALID [2022-02-21 03:36:40,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {10277#(< |ULTIMATE.start_main_~x~0#1| 99954)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {10270#(< |ULTIMATE.start_main_~x~0#1| 99955)} is VALID [2022-02-21 03:36:40,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {10277#(< |ULTIMATE.start_main_~x~0#1| 99954)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {10277#(< |ULTIMATE.start_main_~x~0#1| 99954)} is VALID [2022-02-21 03:36:40,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {9605#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {10277#(< |ULTIMATE.start_main_~x~0#1| 99954)} is VALID [2022-02-21 03:36:40,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {9605#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {9605#true} is VALID [2022-02-21 03:36:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:40,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726903790] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:40,318 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:40,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-02-21 03:36:40,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085991132] [2022-02-21 03:36:40,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:40,318 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:40,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 4 times [2022-02-21 03:36:40,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:40,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441069050] [2022-02-21 03:36:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:40,335 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:40,338 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:40,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:40,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-02-21 03:36:40,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-02-21 03:36:40,372 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. cyclomatic complexity: 17 Second operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:55,716 INFO L93 Difference]: Finished difference Result 2392 states and 3062 transitions. [2022-02-21 03:36:55,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-21 03:36:55,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:55,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:55,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2392 states and 3062 transitions. [2022-02-21 03:36:55,984 INFO L131 ngComponentsAnalysis]: Automaton has 98 accepting balls. 1914 [2022-02-21 03:36:56,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2392 states to 2392 states and 3062 transitions. [2022-02-21 03:36:56,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2204 [2022-02-21 03:36:56,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2204 [2022-02-21 03:36:56,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2392 states and 3062 transitions. [2022-02-21 03:36:56,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:56,117 INFO L681 BuchiCegarLoop]: Abstraction has 2392 states and 3062 transitions. [2022-02-21 03:36:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states and 3062 transitions. [2022-02-21 03:36:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 230. [2022-02-21 03:36:56,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:56,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2392 states and 3062 transitions. Second operand has 230 states, 230 states have (on average 1.0521739130434782) internal successors, (242), 229 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:56,126 INFO L74 IsIncluded]: Start isIncluded. First operand 2392 states and 3062 transitions. Second operand has 230 states, 230 states have (on average 1.0521739130434782) internal successors, (242), 229 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:56,126 INFO L87 Difference]: Start difference. First operand 2392 states and 3062 transitions. Second operand has 230 states, 230 states have (on average 1.0521739130434782) internal successors, (242), 229 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:56,255 INFO L93 Difference]: Finished difference Result 2392 states and 3062 transitions. [2022-02-21 03:36:56,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3062 transitions. [2022-02-21 03:36:56,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:56,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:56,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 230 states have (on average 1.0521739130434782) internal successors, (242), 229 states have internal predecessors, (242), 0 states have call successors, (0), 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 2392 states and 3062 transitions. [2022-02-21 03:36:56,260 INFO L87 Difference]: Start difference. First operand has 230 states, 230 states have (on average 1.0521739130434782) internal successors, (242), 229 states have internal predecessors, (242), 0 states have call successors, (0), 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 2392 states and 3062 transitions. [2022-02-21 03:36:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:56,383 INFO L93 Difference]: Finished difference Result 2392 states and 3062 transitions. [2022-02-21 03:36:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3062 transitions. [2022-02-21 03:36:56,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:56,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:56,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:56,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 230 states have (on average 1.0521739130434782) internal successors, (242), 229 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 242 transitions. [2022-02-21 03:36:56,389 INFO L704 BuchiCegarLoop]: Abstraction has 230 states and 242 transitions. [2022-02-21 03:36:56,389 INFO L587 BuchiCegarLoop]: Abstraction has 230 states and 242 transitions. [2022-02-21 03:36:56,389 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:36:56,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 242 transitions. [2022-02-21 03:36:56,390 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2022-02-21 03:36:56,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:56,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:56,395 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:56,395 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:56,396 INFO L791 eck$LassoCheckResult]: Stem: 12709#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 12685#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 12686#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12719#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12720#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12714#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12715#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12904#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12903#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12902#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12901#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12900#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12899#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12898#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12897#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12896#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12895#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12894#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12893#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12892#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12891#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12890#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12889#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12888#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12887#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12886#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12885#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12884#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12883#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12882#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12881#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12880#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12879#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12878#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12877#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12876#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12875#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12874#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12873#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12872#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12871#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12870#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12869#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12868#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12867#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12866#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12865#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12864#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12863#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12862#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12861#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12860#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12859#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12858#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12857#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12856#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12855#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12854#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12853#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12852#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12851#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12850#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12849#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12848#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12847#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12846#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12845#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12844#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12843#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12842#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12841#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12840#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12839#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12838#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12837#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12836#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12835#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12834#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12833#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12832#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12831#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12830#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12829#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12828#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12827#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12826#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12825#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12824#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12823#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12822#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12821#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12820#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12819#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12818#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12817#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12816#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12815#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12814#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12813#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12812#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12811#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12810#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12809#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12808#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12807#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12806#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12805#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12804#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12803#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12802#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12801#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12800#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12799#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12798#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12797#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12796#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12795#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12794#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12793#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12792#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12791#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12790#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12789#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12788#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12787#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12786#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12785#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12784#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12783#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12782#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12781#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12780#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12779#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12778#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12777#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12776#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12775#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12774#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12773#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12772#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12771#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12770#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12769#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12768#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12767#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12766#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12765#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12764#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12763#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12762#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12761#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12760#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12759#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12758#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12757#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12756#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12755#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12754#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12753#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12752#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12751#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12750#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12749#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12748#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12747#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12746#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12745#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12744#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12743#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12742#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12741#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12740#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12739#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12738#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12737#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12736#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12735#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12734#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12733#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12732#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12731#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12730#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12729#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12728#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12727#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12726#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12725#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12724#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12723#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 12722#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 12721#L33-3 assume !(main_~x~0#1 < 100000); 12681#L33-4 main_~x~0#1 := 0; 12682#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 12701#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 12702#L47-3 [2022-02-21 03:36:56,397 INFO L793 eck$LassoCheckResult]: Loop: 12702#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 12703#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12702#L47-3 [2022-02-21 03:36:56,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1064733596, now seen corresponding path program 5 times [2022-02-21 03:36:56,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:56,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040136532] [2022-02-21 03:36:56,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:56,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:59,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {17695#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); {17695#true} is VALID [2022-02-21 03:36:59,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {17695#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; {17697#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:59,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {17697#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17697#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:36:59,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {17697#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17698#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:59,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {17698#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17698#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:36:59,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {17698#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17699#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:59,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {17699#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17699#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:36:59,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {17699#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17700#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:59,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {17700#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17700#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:36:59,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {17700#(<= |ULTIMATE.start_main_~x~0#1| 3)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17701#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:59,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {17701#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17701#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:36:59,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {17701#(<= |ULTIMATE.start_main_~x~0#1| 4)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17702#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:36:59,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {17702#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17702#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:36:59,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {17702#(<= |ULTIMATE.start_main_~x~0#1| 5)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17703#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:36:59,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {17703#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17703#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:36:59,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {17703#(<= |ULTIMATE.start_main_~x~0#1| 6)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17704#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:36:59,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {17704#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17704#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:36:59,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {17704#(<= |ULTIMATE.start_main_~x~0#1| 7)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17705#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:36:59,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {17705#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17705#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:36:59,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {17705#(<= |ULTIMATE.start_main_~x~0#1| 8)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17706#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:36:59,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {17706#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17706#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:36:59,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {17706#(<= |ULTIMATE.start_main_~x~0#1| 9)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17707#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:36:59,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {17707#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17707#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:36:59,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {17707#(<= |ULTIMATE.start_main_~x~0#1| 10)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17708#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:36:59,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {17708#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17708#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:36:59,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {17708#(<= |ULTIMATE.start_main_~x~0#1| 11)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17709#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-21 03:36:59,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {17709#(<= |ULTIMATE.start_main_~x~0#1| 12)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17709#(<= |ULTIMATE.start_main_~x~0#1| 12)} is VALID [2022-02-21 03:36:59,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {17709#(<= |ULTIMATE.start_main_~x~0#1| 12)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17710#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-21 03:36:59,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {17710#(<= |ULTIMATE.start_main_~x~0#1| 13)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17710#(<= |ULTIMATE.start_main_~x~0#1| 13)} is VALID [2022-02-21 03:36:59,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {17710#(<= |ULTIMATE.start_main_~x~0#1| 13)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17711#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-21 03:36:59,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {17711#(<= |ULTIMATE.start_main_~x~0#1| 14)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17711#(<= |ULTIMATE.start_main_~x~0#1| 14)} is VALID [2022-02-21 03:36:59,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {17711#(<= |ULTIMATE.start_main_~x~0#1| 14)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17712#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-21 03:36:59,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {17712#(<= |ULTIMATE.start_main_~x~0#1| 15)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17712#(<= |ULTIMATE.start_main_~x~0#1| 15)} is VALID [2022-02-21 03:36:59,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {17712#(<= |ULTIMATE.start_main_~x~0#1| 15)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17713#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:36:59,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {17713#(<= |ULTIMATE.start_main_~x~0#1| 16)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17713#(<= |ULTIMATE.start_main_~x~0#1| 16)} is VALID [2022-02-21 03:36:59,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {17713#(<= |ULTIMATE.start_main_~x~0#1| 16)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17714#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-21 03:36:59,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {17714#(<= |ULTIMATE.start_main_~x~0#1| 17)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17714#(<= |ULTIMATE.start_main_~x~0#1| 17)} is VALID [2022-02-21 03:36:59,754 INFO L290 TraceCheckUtils]: 37: Hoare triple {17714#(<= |ULTIMATE.start_main_~x~0#1| 17)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17715#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-21 03:36:59,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {17715#(<= |ULTIMATE.start_main_~x~0#1| 18)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17715#(<= |ULTIMATE.start_main_~x~0#1| 18)} is VALID [2022-02-21 03:36:59,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {17715#(<= |ULTIMATE.start_main_~x~0#1| 18)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17716#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-21 03:36:59,755 INFO L290 TraceCheckUtils]: 40: Hoare triple {17716#(<= |ULTIMATE.start_main_~x~0#1| 19)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17716#(<= |ULTIMATE.start_main_~x~0#1| 19)} is VALID [2022-02-21 03:36:59,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {17716#(<= |ULTIMATE.start_main_~x~0#1| 19)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17717#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-21 03:36:59,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {17717#(<= |ULTIMATE.start_main_~x~0#1| 20)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17717#(<= |ULTIMATE.start_main_~x~0#1| 20)} is VALID [2022-02-21 03:36:59,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {17717#(<= |ULTIMATE.start_main_~x~0#1| 20)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17718#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-21 03:36:59,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {17718#(<= |ULTIMATE.start_main_~x~0#1| 21)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17718#(<= |ULTIMATE.start_main_~x~0#1| 21)} is VALID [2022-02-21 03:36:59,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {17718#(<= |ULTIMATE.start_main_~x~0#1| 21)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17719#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-21 03:36:59,757 INFO L290 TraceCheckUtils]: 46: Hoare triple {17719#(<= |ULTIMATE.start_main_~x~0#1| 22)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17719#(<= |ULTIMATE.start_main_~x~0#1| 22)} is VALID [2022-02-21 03:36:59,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {17719#(<= |ULTIMATE.start_main_~x~0#1| 22)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17720#(<= |ULTIMATE.start_main_~x~0#1| 23)} is VALID [2022-02-21 03:36:59,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {17720#(<= |ULTIMATE.start_main_~x~0#1| 23)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17720#(<= |ULTIMATE.start_main_~x~0#1| 23)} is VALID [2022-02-21 03:36:59,758 INFO L290 TraceCheckUtils]: 49: Hoare triple {17720#(<= |ULTIMATE.start_main_~x~0#1| 23)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17721#(<= |ULTIMATE.start_main_~x~0#1| 24)} is VALID [2022-02-21 03:36:59,758 INFO L290 TraceCheckUtils]: 50: Hoare triple {17721#(<= |ULTIMATE.start_main_~x~0#1| 24)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17721#(<= |ULTIMATE.start_main_~x~0#1| 24)} is VALID [2022-02-21 03:36:59,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {17721#(<= |ULTIMATE.start_main_~x~0#1| 24)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17722#(<= |ULTIMATE.start_main_~x~0#1| 25)} is VALID [2022-02-21 03:36:59,759 INFO L290 TraceCheckUtils]: 52: Hoare triple {17722#(<= |ULTIMATE.start_main_~x~0#1| 25)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17722#(<= |ULTIMATE.start_main_~x~0#1| 25)} is VALID [2022-02-21 03:36:59,759 INFO L290 TraceCheckUtils]: 53: Hoare triple {17722#(<= |ULTIMATE.start_main_~x~0#1| 25)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17723#(<= |ULTIMATE.start_main_~x~0#1| 26)} is VALID [2022-02-21 03:36:59,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {17723#(<= |ULTIMATE.start_main_~x~0#1| 26)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17723#(<= |ULTIMATE.start_main_~x~0#1| 26)} is VALID [2022-02-21 03:36:59,760 INFO L290 TraceCheckUtils]: 55: Hoare triple {17723#(<= |ULTIMATE.start_main_~x~0#1| 26)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17724#(<= |ULTIMATE.start_main_~x~0#1| 27)} is VALID [2022-02-21 03:36:59,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {17724#(<= |ULTIMATE.start_main_~x~0#1| 27)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17724#(<= |ULTIMATE.start_main_~x~0#1| 27)} is VALID [2022-02-21 03:36:59,761 INFO L290 TraceCheckUtils]: 57: Hoare triple {17724#(<= |ULTIMATE.start_main_~x~0#1| 27)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17725#(<= |ULTIMATE.start_main_~x~0#1| 28)} is VALID [2022-02-21 03:36:59,761 INFO L290 TraceCheckUtils]: 58: Hoare triple {17725#(<= |ULTIMATE.start_main_~x~0#1| 28)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17725#(<= |ULTIMATE.start_main_~x~0#1| 28)} is VALID [2022-02-21 03:36:59,761 INFO L290 TraceCheckUtils]: 59: Hoare triple {17725#(<= |ULTIMATE.start_main_~x~0#1| 28)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17726#(<= |ULTIMATE.start_main_~x~0#1| 29)} is VALID [2022-02-21 03:36:59,762 INFO L290 TraceCheckUtils]: 60: Hoare triple {17726#(<= |ULTIMATE.start_main_~x~0#1| 29)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17726#(<= |ULTIMATE.start_main_~x~0#1| 29)} is VALID [2022-02-21 03:36:59,762 INFO L290 TraceCheckUtils]: 61: Hoare triple {17726#(<= |ULTIMATE.start_main_~x~0#1| 29)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17727#(<= |ULTIMATE.start_main_~x~0#1| 30)} is VALID [2022-02-21 03:36:59,762 INFO L290 TraceCheckUtils]: 62: Hoare triple {17727#(<= |ULTIMATE.start_main_~x~0#1| 30)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17727#(<= |ULTIMATE.start_main_~x~0#1| 30)} is VALID [2022-02-21 03:36:59,763 INFO L290 TraceCheckUtils]: 63: Hoare triple {17727#(<= |ULTIMATE.start_main_~x~0#1| 30)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17728#(<= |ULTIMATE.start_main_~x~0#1| 31)} is VALID [2022-02-21 03:36:59,763 INFO L290 TraceCheckUtils]: 64: Hoare triple {17728#(<= |ULTIMATE.start_main_~x~0#1| 31)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17728#(<= |ULTIMATE.start_main_~x~0#1| 31)} is VALID [2022-02-21 03:36:59,764 INFO L290 TraceCheckUtils]: 65: Hoare triple {17728#(<= |ULTIMATE.start_main_~x~0#1| 31)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17729#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:36:59,764 INFO L290 TraceCheckUtils]: 66: Hoare triple {17729#(<= |ULTIMATE.start_main_~x~0#1| 32)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17729#(<= |ULTIMATE.start_main_~x~0#1| 32)} is VALID [2022-02-21 03:36:59,764 INFO L290 TraceCheckUtils]: 67: Hoare triple {17729#(<= |ULTIMATE.start_main_~x~0#1| 32)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17730#(<= |ULTIMATE.start_main_~x~0#1| 33)} is VALID [2022-02-21 03:36:59,764 INFO L290 TraceCheckUtils]: 68: Hoare triple {17730#(<= |ULTIMATE.start_main_~x~0#1| 33)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17730#(<= |ULTIMATE.start_main_~x~0#1| 33)} is VALID [2022-02-21 03:36:59,765 INFO L290 TraceCheckUtils]: 69: Hoare triple {17730#(<= |ULTIMATE.start_main_~x~0#1| 33)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17731#(<= |ULTIMATE.start_main_~x~0#1| 34)} is VALID [2022-02-21 03:36:59,765 INFO L290 TraceCheckUtils]: 70: Hoare triple {17731#(<= |ULTIMATE.start_main_~x~0#1| 34)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17731#(<= |ULTIMATE.start_main_~x~0#1| 34)} is VALID [2022-02-21 03:36:59,766 INFO L290 TraceCheckUtils]: 71: Hoare triple {17731#(<= |ULTIMATE.start_main_~x~0#1| 34)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17732#(<= |ULTIMATE.start_main_~x~0#1| 35)} is VALID [2022-02-21 03:36:59,766 INFO L290 TraceCheckUtils]: 72: Hoare triple {17732#(<= |ULTIMATE.start_main_~x~0#1| 35)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17732#(<= |ULTIMATE.start_main_~x~0#1| 35)} is VALID [2022-02-21 03:36:59,766 INFO L290 TraceCheckUtils]: 73: Hoare triple {17732#(<= |ULTIMATE.start_main_~x~0#1| 35)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17733#(<= |ULTIMATE.start_main_~x~0#1| 36)} is VALID [2022-02-21 03:36:59,766 INFO L290 TraceCheckUtils]: 74: Hoare triple {17733#(<= |ULTIMATE.start_main_~x~0#1| 36)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17733#(<= |ULTIMATE.start_main_~x~0#1| 36)} is VALID [2022-02-21 03:36:59,767 INFO L290 TraceCheckUtils]: 75: Hoare triple {17733#(<= |ULTIMATE.start_main_~x~0#1| 36)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17734#(<= |ULTIMATE.start_main_~x~0#1| 37)} is VALID [2022-02-21 03:36:59,767 INFO L290 TraceCheckUtils]: 76: Hoare triple {17734#(<= |ULTIMATE.start_main_~x~0#1| 37)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17734#(<= |ULTIMATE.start_main_~x~0#1| 37)} is VALID [2022-02-21 03:36:59,768 INFO L290 TraceCheckUtils]: 77: Hoare triple {17734#(<= |ULTIMATE.start_main_~x~0#1| 37)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17735#(<= |ULTIMATE.start_main_~x~0#1| 38)} is VALID [2022-02-21 03:36:59,768 INFO L290 TraceCheckUtils]: 78: Hoare triple {17735#(<= |ULTIMATE.start_main_~x~0#1| 38)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17735#(<= |ULTIMATE.start_main_~x~0#1| 38)} is VALID [2022-02-21 03:36:59,768 INFO L290 TraceCheckUtils]: 79: Hoare triple {17735#(<= |ULTIMATE.start_main_~x~0#1| 38)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17736#(<= |ULTIMATE.start_main_~x~0#1| 39)} is VALID [2022-02-21 03:36:59,769 INFO L290 TraceCheckUtils]: 80: Hoare triple {17736#(<= |ULTIMATE.start_main_~x~0#1| 39)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17736#(<= |ULTIMATE.start_main_~x~0#1| 39)} is VALID [2022-02-21 03:36:59,769 INFO L290 TraceCheckUtils]: 81: Hoare triple {17736#(<= |ULTIMATE.start_main_~x~0#1| 39)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17737#(<= |ULTIMATE.start_main_~x~0#1| 40)} is VALID [2022-02-21 03:36:59,769 INFO L290 TraceCheckUtils]: 82: Hoare triple {17737#(<= |ULTIMATE.start_main_~x~0#1| 40)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17737#(<= |ULTIMATE.start_main_~x~0#1| 40)} is VALID [2022-02-21 03:36:59,770 INFO L290 TraceCheckUtils]: 83: Hoare triple {17737#(<= |ULTIMATE.start_main_~x~0#1| 40)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17738#(<= |ULTIMATE.start_main_~x~0#1| 41)} is VALID [2022-02-21 03:36:59,770 INFO L290 TraceCheckUtils]: 84: Hoare triple {17738#(<= |ULTIMATE.start_main_~x~0#1| 41)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17738#(<= |ULTIMATE.start_main_~x~0#1| 41)} is VALID [2022-02-21 03:36:59,770 INFO L290 TraceCheckUtils]: 85: Hoare triple {17738#(<= |ULTIMATE.start_main_~x~0#1| 41)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17739#(<= |ULTIMATE.start_main_~x~0#1| 42)} is VALID [2022-02-21 03:36:59,770 INFO L290 TraceCheckUtils]: 86: Hoare triple {17739#(<= |ULTIMATE.start_main_~x~0#1| 42)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17739#(<= |ULTIMATE.start_main_~x~0#1| 42)} is VALID [2022-02-21 03:36:59,771 INFO L290 TraceCheckUtils]: 87: Hoare triple {17739#(<= |ULTIMATE.start_main_~x~0#1| 42)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17740#(<= |ULTIMATE.start_main_~x~0#1| 43)} is VALID [2022-02-21 03:36:59,771 INFO L290 TraceCheckUtils]: 88: Hoare triple {17740#(<= |ULTIMATE.start_main_~x~0#1| 43)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17740#(<= |ULTIMATE.start_main_~x~0#1| 43)} is VALID [2022-02-21 03:36:59,772 INFO L290 TraceCheckUtils]: 89: Hoare triple {17740#(<= |ULTIMATE.start_main_~x~0#1| 43)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17741#(<= |ULTIMATE.start_main_~x~0#1| 44)} is VALID [2022-02-21 03:36:59,773 INFO L290 TraceCheckUtils]: 90: Hoare triple {17741#(<= |ULTIMATE.start_main_~x~0#1| 44)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17741#(<= |ULTIMATE.start_main_~x~0#1| 44)} is VALID [2022-02-21 03:36:59,773 INFO L290 TraceCheckUtils]: 91: Hoare triple {17741#(<= |ULTIMATE.start_main_~x~0#1| 44)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17742#(<= |ULTIMATE.start_main_~x~0#1| 45)} is VALID [2022-02-21 03:36:59,773 INFO L290 TraceCheckUtils]: 92: Hoare triple {17742#(<= |ULTIMATE.start_main_~x~0#1| 45)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17742#(<= |ULTIMATE.start_main_~x~0#1| 45)} is VALID [2022-02-21 03:36:59,774 INFO L290 TraceCheckUtils]: 93: Hoare triple {17742#(<= |ULTIMATE.start_main_~x~0#1| 45)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17743#(<= |ULTIMATE.start_main_~x~0#1| 46)} is VALID [2022-02-21 03:36:59,774 INFO L290 TraceCheckUtils]: 94: Hoare triple {17743#(<= |ULTIMATE.start_main_~x~0#1| 46)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17743#(<= |ULTIMATE.start_main_~x~0#1| 46)} is VALID [2022-02-21 03:36:59,774 INFO L290 TraceCheckUtils]: 95: Hoare triple {17743#(<= |ULTIMATE.start_main_~x~0#1| 46)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17744#(<= |ULTIMATE.start_main_~x~0#1| 47)} is VALID [2022-02-21 03:36:59,775 INFO L290 TraceCheckUtils]: 96: Hoare triple {17744#(<= |ULTIMATE.start_main_~x~0#1| 47)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17744#(<= |ULTIMATE.start_main_~x~0#1| 47)} is VALID [2022-02-21 03:36:59,775 INFO L290 TraceCheckUtils]: 97: Hoare triple {17744#(<= |ULTIMATE.start_main_~x~0#1| 47)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17745#(<= |ULTIMATE.start_main_~x~0#1| 48)} is VALID [2022-02-21 03:36:59,775 INFO L290 TraceCheckUtils]: 98: Hoare triple {17745#(<= |ULTIMATE.start_main_~x~0#1| 48)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17745#(<= |ULTIMATE.start_main_~x~0#1| 48)} is VALID [2022-02-21 03:36:59,776 INFO L290 TraceCheckUtils]: 99: Hoare triple {17745#(<= |ULTIMATE.start_main_~x~0#1| 48)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17746#(<= |ULTIMATE.start_main_~x~0#1| 49)} is VALID [2022-02-21 03:36:59,776 INFO L290 TraceCheckUtils]: 100: Hoare triple {17746#(<= |ULTIMATE.start_main_~x~0#1| 49)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17746#(<= |ULTIMATE.start_main_~x~0#1| 49)} is VALID [2022-02-21 03:36:59,776 INFO L290 TraceCheckUtils]: 101: Hoare triple {17746#(<= |ULTIMATE.start_main_~x~0#1| 49)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17747#(<= |ULTIMATE.start_main_~x~0#1| 50)} is VALID [2022-02-21 03:36:59,777 INFO L290 TraceCheckUtils]: 102: Hoare triple {17747#(<= |ULTIMATE.start_main_~x~0#1| 50)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17747#(<= |ULTIMATE.start_main_~x~0#1| 50)} is VALID [2022-02-21 03:36:59,777 INFO L290 TraceCheckUtils]: 103: Hoare triple {17747#(<= |ULTIMATE.start_main_~x~0#1| 50)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17748#(<= |ULTIMATE.start_main_~x~0#1| 51)} is VALID [2022-02-21 03:36:59,777 INFO L290 TraceCheckUtils]: 104: Hoare triple {17748#(<= |ULTIMATE.start_main_~x~0#1| 51)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17748#(<= |ULTIMATE.start_main_~x~0#1| 51)} is VALID [2022-02-21 03:36:59,778 INFO L290 TraceCheckUtils]: 105: Hoare triple {17748#(<= |ULTIMATE.start_main_~x~0#1| 51)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17749#(<= |ULTIMATE.start_main_~x~0#1| 52)} is VALID [2022-02-21 03:36:59,778 INFO L290 TraceCheckUtils]: 106: Hoare triple {17749#(<= |ULTIMATE.start_main_~x~0#1| 52)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17749#(<= |ULTIMATE.start_main_~x~0#1| 52)} is VALID [2022-02-21 03:36:59,778 INFO L290 TraceCheckUtils]: 107: Hoare triple {17749#(<= |ULTIMATE.start_main_~x~0#1| 52)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17750#(<= |ULTIMATE.start_main_~x~0#1| 53)} is VALID [2022-02-21 03:36:59,779 INFO L290 TraceCheckUtils]: 108: Hoare triple {17750#(<= |ULTIMATE.start_main_~x~0#1| 53)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17750#(<= |ULTIMATE.start_main_~x~0#1| 53)} is VALID [2022-02-21 03:36:59,779 INFO L290 TraceCheckUtils]: 109: Hoare triple {17750#(<= |ULTIMATE.start_main_~x~0#1| 53)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17751#(<= |ULTIMATE.start_main_~x~0#1| 54)} is VALID [2022-02-21 03:36:59,779 INFO L290 TraceCheckUtils]: 110: Hoare triple {17751#(<= |ULTIMATE.start_main_~x~0#1| 54)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17751#(<= |ULTIMATE.start_main_~x~0#1| 54)} is VALID [2022-02-21 03:36:59,780 INFO L290 TraceCheckUtils]: 111: Hoare triple {17751#(<= |ULTIMATE.start_main_~x~0#1| 54)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17752#(<= |ULTIMATE.start_main_~x~0#1| 55)} is VALID [2022-02-21 03:36:59,780 INFO L290 TraceCheckUtils]: 112: Hoare triple {17752#(<= |ULTIMATE.start_main_~x~0#1| 55)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17752#(<= |ULTIMATE.start_main_~x~0#1| 55)} is VALID [2022-02-21 03:36:59,780 INFO L290 TraceCheckUtils]: 113: Hoare triple {17752#(<= |ULTIMATE.start_main_~x~0#1| 55)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17753#(<= |ULTIMATE.start_main_~x~0#1| 56)} is VALID [2022-02-21 03:36:59,781 INFO L290 TraceCheckUtils]: 114: Hoare triple {17753#(<= |ULTIMATE.start_main_~x~0#1| 56)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17753#(<= |ULTIMATE.start_main_~x~0#1| 56)} is VALID [2022-02-21 03:36:59,781 INFO L290 TraceCheckUtils]: 115: Hoare triple {17753#(<= |ULTIMATE.start_main_~x~0#1| 56)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17754#(<= |ULTIMATE.start_main_~x~0#1| 57)} is VALID [2022-02-21 03:36:59,781 INFO L290 TraceCheckUtils]: 116: Hoare triple {17754#(<= |ULTIMATE.start_main_~x~0#1| 57)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17754#(<= |ULTIMATE.start_main_~x~0#1| 57)} is VALID [2022-02-21 03:36:59,782 INFO L290 TraceCheckUtils]: 117: Hoare triple {17754#(<= |ULTIMATE.start_main_~x~0#1| 57)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17755#(<= |ULTIMATE.start_main_~x~0#1| 58)} is VALID [2022-02-21 03:36:59,782 INFO L290 TraceCheckUtils]: 118: Hoare triple {17755#(<= |ULTIMATE.start_main_~x~0#1| 58)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17755#(<= |ULTIMATE.start_main_~x~0#1| 58)} is VALID [2022-02-21 03:36:59,782 INFO L290 TraceCheckUtils]: 119: Hoare triple {17755#(<= |ULTIMATE.start_main_~x~0#1| 58)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17756#(<= |ULTIMATE.start_main_~x~0#1| 59)} is VALID [2022-02-21 03:36:59,783 INFO L290 TraceCheckUtils]: 120: Hoare triple {17756#(<= |ULTIMATE.start_main_~x~0#1| 59)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17756#(<= |ULTIMATE.start_main_~x~0#1| 59)} is VALID [2022-02-21 03:36:59,783 INFO L290 TraceCheckUtils]: 121: Hoare triple {17756#(<= |ULTIMATE.start_main_~x~0#1| 59)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17757#(<= |ULTIMATE.start_main_~x~0#1| 60)} is VALID [2022-02-21 03:36:59,783 INFO L290 TraceCheckUtils]: 122: Hoare triple {17757#(<= |ULTIMATE.start_main_~x~0#1| 60)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17757#(<= |ULTIMATE.start_main_~x~0#1| 60)} is VALID [2022-02-21 03:36:59,784 INFO L290 TraceCheckUtils]: 123: Hoare triple {17757#(<= |ULTIMATE.start_main_~x~0#1| 60)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17758#(<= |ULTIMATE.start_main_~x~0#1| 61)} is VALID [2022-02-21 03:36:59,784 INFO L290 TraceCheckUtils]: 124: Hoare triple {17758#(<= |ULTIMATE.start_main_~x~0#1| 61)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17758#(<= |ULTIMATE.start_main_~x~0#1| 61)} is VALID [2022-02-21 03:36:59,784 INFO L290 TraceCheckUtils]: 125: Hoare triple {17758#(<= |ULTIMATE.start_main_~x~0#1| 61)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17759#(<= |ULTIMATE.start_main_~x~0#1| 62)} is VALID [2022-02-21 03:36:59,808 INFO L290 TraceCheckUtils]: 126: Hoare triple {17759#(<= |ULTIMATE.start_main_~x~0#1| 62)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17759#(<= |ULTIMATE.start_main_~x~0#1| 62)} is VALID [2022-02-21 03:36:59,809 INFO L290 TraceCheckUtils]: 127: Hoare triple {17759#(<= |ULTIMATE.start_main_~x~0#1| 62)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17760#(<= |ULTIMATE.start_main_~x~0#1| 63)} is VALID [2022-02-21 03:36:59,810 INFO L290 TraceCheckUtils]: 128: Hoare triple {17760#(<= |ULTIMATE.start_main_~x~0#1| 63)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17760#(<= |ULTIMATE.start_main_~x~0#1| 63)} is VALID [2022-02-21 03:36:59,810 INFO L290 TraceCheckUtils]: 129: Hoare triple {17760#(<= |ULTIMATE.start_main_~x~0#1| 63)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17761#(<= |ULTIMATE.start_main_~x~0#1| 64)} is VALID [2022-02-21 03:36:59,810 INFO L290 TraceCheckUtils]: 130: Hoare triple {17761#(<= |ULTIMATE.start_main_~x~0#1| 64)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17761#(<= |ULTIMATE.start_main_~x~0#1| 64)} is VALID [2022-02-21 03:36:59,811 INFO L290 TraceCheckUtils]: 131: Hoare triple {17761#(<= |ULTIMATE.start_main_~x~0#1| 64)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17762#(<= |ULTIMATE.start_main_~x~0#1| 65)} is VALID [2022-02-21 03:36:59,811 INFO L290 TraceCheckUtils]: 132: Hoare triple {17762#(<= |ULTIMATE.start_main_~x~0#1| 65)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17762#(<= |ULTIMATE.start_main_~x~0#1| 65)} is VALID [2022-02-21 03:36:59,812 INFO L290 TraceCheckUtils]: 133: Hoare triple {17762#(<= |ULTIMATE.start_main_~x~0#1| 65)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17763#(<= |ULTIMATE.start_main_~x~0#1| 66)} is VALID [2022-02-21 03:36:59,813 INFO L290 TraceCheckUtils]: 134: Hoare triple {17763#(<= |ULTIMATE.start_main_~x~0#1| 66)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17763#(<= |ULTIMATE.start_main_~x~0#1| 66)} is VALID [2022-02-21 03:36:59,813 INFO L290 TraceCheckUtils]: 135: Hoare triple {17763#(<= |ULTIMATE.start_main_~x~0#1| 66)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17764#(<= |ULTIMATE.start_main_~x~0#1| 67)} is VALID [2022-02-21 03:36:59,813 INFO L290 TraceCheckUtils]: 136: Hoare triple {17764#(<= |ULTIMATE.start_main_~x~0#1| 67)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17764#(<= |ULTIMATE.start_main_~x~0#1| 67)} is VALID [2022-02-21 03:36:59,814 INFO L290 TraceCheckUtils]: 137: Hoare triple {17764#(<= |ULTIMATE.start_main_~x~0#1| 67)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17765#(<= |ULTIMATE.start_main_~x~0#1| 68)} is VALID [2022-02-21 03:36:59,814 INFO L290 TraceCheckUtils]: 138: Hoare triple {17765#(<= |ULTIMATE.start_main_~x~0#1| 68)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17765#(<= |ULTIMATE.start_main_~x~0#1| 68)} is VALID [2022-02-21 03:36:59,814 INFO L290 TraceCheckUtils]: 139: Hoare triple {17765#(<= |ULTIMATE.start_main_~x~0#1| 68)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17766#(<= |ULTIMATE.start_main_~x~0#1| 69)} is VALID [2022-02-21 03:36:59,815 INFO L290 TraceCheckUtils]: 140: Hoare triple {17766#(<= |ULTIMATE.start_main_~x~0#1| 69)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17766#(<= |ULTIMATE.start_main_~x~0#1| 69)} is VALID [2022-02-21 03:36:59,815 INFO L290 TraceCheckUtils]: 141: Hoare triple {17766#(<= |ULTIMATE.start_main_~x~0#1| 69)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17767#(<= |ULTIMATE.start_main_~x~0#1| 70)} is VALID [2022-02-21 03:36:59,815 INFO L290 TraceCheckUtils]: 142: Hoare triple {17767#(<= |ULTIMATE.start_main_~x~0#1| 70)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17767#(<= |ULTIMATE.start_main_~x~0#1| 70)} is VALID [2022-02-21 03:36:59,816 INFO L290 TraceCheckUtils]: 143: Hoare triple {17767#(<= |ULTIMATE.start_main_~x~0#1| 70)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17768#(<= |ULTIMATE.start_main_~x~0#1| 71)} is VALID [2022-02-21 03:36:59,816 INFO L290 TraceCheckUtils]: 144: Hoare triple {17768#(<= |ULTIMATE.start_main_~x~0#1| 71)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17768#(<= |ULTIMATE.start_main_~x~0#1| 71)} is VALID [2022-02-21 03:36:59,816 INFO L290 TraceCheckUtils]: 145: Hoare triple {17768#(<= |ULTIMATE.start_main_~x~0#1| 71)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17769#(<= |ULTIMATE.start_main_~x~0#1| 72)} is VALID [2022-02-21 03:36:59,816 INFO L290 TraceCheckUtils]: 146: Hoare triple {17769#(<= |ULTIMATE.start_main_~x~0#1| 72)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17769#(<= |ULTIMATE.start_main_~x~0#1| 72)} is VALID [2022-02-21 03:36:59,817 INFO L290 TraceCheckUtils]: 147: Hoare triple {17769#(<= |ULTIMATE.start_main_~x~0#1| 72)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17770#(<= |ULTIMATE.start_main_~x~0#1| 73)} is VALID [2022-02-21 03:36:59,817 INFO L290 TraceCheckUtils]: 148: Hoare triple {17770#(<= |ULTIMATE.start_main_~x~0#1| 73)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17770#(<= |ULTIMATE.start_main_~x~0#1| 73)} is VALID [2022-02-21 03:36:59,817 INFO L290 TraceCheckUtils]: 149: Hoare triple {17770#(<= |ULTIMATE.start_main_~x~0#1| 73)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17771#(<= |ULTIMATE.start_main_~x~0#1| 74)} is VALID [2022-02-21 03:36:59,818 INFO L290 TraceCheckUtils]: 150: Hoare triple {17771#(<= |ULTIMATE.start_main_~x~0#1| 74)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17771#(<= |ULTIMATE.start_main_~x~0#1| 74)} is VALID [2022-02-21 03:36:59,818 INFO L290 TraceCheckUtils]: 151: Hoare triple {17771#(<= |ULTIMATE.start_main_~x~0#1| 74)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17772#(<= |ULTIMATE.start_main_~x~0#1| 75)} is VALID [2022-02-21 03:36:59,819 INFO L290 TraceCheckUtils]: 152: Hoare triple {17772#(<= |ULTIMATE.start_main_~x~0#1| 75)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17772#(<= |ULTIMATE.start_main_~x~0#1| 75)} is VALID [2022-02-21 03:36:59,819 INFO L290 TraceCheckUtils]: 153: Hoare triple {17772#(<= |ULTIMATE.start_main_~x~0#1| 75)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17773#(<= |ULTIMATE.start_main_~x~0#1| 76)} is VALID [2022-02-21 03:36:59,820 INFO L290 TraceCheckUtils]: 154: Hoare triple {17773#(<= |ULTIMATE.start_main_~x~0#1| 76)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17773#(<= |ULTIMATE.start_main_~x~0#1| 76)} is VALID [2022-02-21 03:36:59,820 INFO L290 TraceCheckUtils]: 155: Hoare triple {17773#(<= |ULTIMATE.start_main_~x~0#1| 76)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17774#(<= |ULTIMATE.start_main_~x~0#1| 77)} is VALID [2022-02-21 03:36:59,820 INFO L290 TraceCheckUtils]: 156: Hoare triple {17774#(<= |ULTIMATE.start_main_~x~0#1| 77)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17774#(<= |ULTIMATE.start_main_~x~0#1| 77)} is VALID [2022-02-21 03:36:59,821 INFO L290 TraceCheckUtils]: 157: Hoare triple {17774#(<= |ULTIMATE.start_main_~x~0#1| 77)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17775#(<= |ULTIMATE.start_main_~x~0#1| 78)} is VALID [2022-02-21 03:36:59,821 INFO L290 TraceCheckUtils]: 158: Hoare triple {17775#(<= |ULTIMATE.start_main_~x~0#1| 78)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17775#(<= |ULTIMATE.start_main_~x~0#1| 78)} is VALID [2022-02-21 03:36:59,821 INFO L290 TraceCheckUtils]: 159: Hoare triple {17775#(<= |ULTIMATE.start_main_~x~0#1| 78)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17776#(<= |ULTIMATE.start_main_~x~0#1| 79)} is VALID [2022-02-21 03:36:59,821 INFO L290 TraceCheckUtils]: 160: Hoare triple {17776#(<= |ULTIMATE.start_main_~x~0#1| 79)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17776#(<= |ULTIMATE.start_main_~x~0#1| 79)} is VALID [2022-02-21 03:36:59,822 INFO L290 TraceCheckUtils]: 161: Hoare triple {17776#(<= |ULTIMATE.start_main_~x~0#1| 79)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17777#(<= |ULTIMATE.start_main_~x~0#1| 80)} is VALID [2022-02-21 03:36:59,822 INFO L290 TraceCheckUtils]: 162: Hoare triple {17777#(<= |ULTIMATE.start_main_~x~0#1| 80)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17777#(<= |ULTIMATE.start_main_~x~0#1| 80)} is VALID [2022-02-21 03:36:59,822 INFO L290 TraceCheckUtils]: 163: Hoare triple {17777#(<= |ULTIMATE.start_main_~x~0#1| 80)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17778#(<= |ULTIMATE.start_main_~x~0#1| 81)} is VALID [2022-02-21 03:36:59,823 INFO L290 TraceCheckUtils]: 164: Hoare triple {17778#(<= |ULTIMATE.start_main_~x~0#1| 81)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17778#(<= |ULTIMATE.start_main_~x~0#1| 81)} is VALID [2022-02-21 03:36:59,823 INFO L290 TraceCheckUtils]: 165: Hoare triple {17778#(<= |ULTIMATE.start_main_~x~0#1| 81)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17779#(<= |ULTIMATE.start_main_~x~0#1| 82)} is VALID [2022-02-21 03:36:59,823 INFO L290 TraceCheckUtils]: 166: Hoare triple {17779#(<= |ULTIMATE.start_main_~x~0#1| 82)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17779#(<= |ULTIMATE.start_main_~x~0#1| 82)} is VALID [2022-02-21 03:36:59,824 INFO L290 TraceCheckUtils]: 167: Hoare triple {17779#(<= |ULTIMATE.start_main_~x~0#1| 82)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17780#(<= |ULTIMATE.start_main_~x~0#1| 83)} is VALID [2022-02-21 03:36:59,824 INFO L290 TraceCheckUtils]: 168: Hoare triple {17780#(<= |ULTIMATE.start_main_~x~0#1| 83)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17780#(<= |ULTIMATE.start_main_~x~0#1| 83)} is VALID [2022-02-21 03:36:59,824 INFO L290 TraceCheckUtils]: 169: Hoare triple {17780#(<= |ULTIMATE.start_main_~x~0#1| 83)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17781#(<= |ULTIMATE.start_main_~x~0#1| 84)} is VALID [2022-02-21 03:36:59,832 INFO L290 TraceCheckUtils]: 170: Hoare triple {17781#(<= |ULTIMATE.start_main_~x~0#1| 84)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17781#(<= |ULTIMATE.start_main_~x~0#1| 84)} is VALID [2022-02-21 03:36:59,833 INFO L290 TraceCheckUtils]: 171: Hoare triple {17781#(<= |ULTIMATE.start_main_~x~0#1| 84)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17782#(<= |ULTIMATE.start_main_~x~0#1| 85)} is VALID [2022-02-21 03:36:59,833 INFO L290 TraceCheckUtils]: 172: Hoare triple {17782#(<= |ULTIMATE.start_main_~x~0#1| 85)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17782#(<= |ULTIMATE.start_main_~x~0#1| 85)} is VALID [2022-02-21 03:36:59,834 INFO L290 TraceCheckUtils]: 173: Hoare triple {17782#(<= |ULTIMATE.start_main_~x~0#1| 85)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17783#(<= |ULTIMATE.start_main_~x~0#1| 86)} is VALID [2022-02-21 03:36:59,834 INFO L290 TraceCheckUtils]: 174: Hoare triple {17783#(<= |ULTIMATE.start_main_~x~0#1| 86)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17783#(<= |ULTIMATE.start_main_~x~0#1| 86)} is VALID [2022-02-21 03:36:59,835 INFO L290 TraceCheckUtils]: 175: Hoare triple {17783#(<= |ULTIMATE.start_main_~x~0#1| 86)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17784#(<= |ULTIMATE.start_main_~x~0#1| 87)} is VALID [2022-02-21 03:36:59,835 INFO L290 TraceCheckUtils]: 176: Hoare triple {17784#(<= |ULTIMATE.start_main_~x~0#1| 87)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17784#(<= |ULTIMATE.start_main_~x~0#1| 87)} is VALID [2022-02-21 03:36:59,836 INFO L290 TraceCheckUtils]: 177: Hoare triple {17784#(<= |ULTIMATE.start_main_~x~0#1| 87)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17785#(<= |ULTIMATE.start_main_~x~0#1| 88)} is VALID [2022-02-21 03:36:59,836 INFO L290 TraceCheckUtils]: 178: Hoare triple {17785#(<= |ULTIMATE.start_main_~x~0#1| 88)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17785#(<= |ULTIMATE.start_main_~x~0#1| 88)} is VALID [2022-02-21 03:36:59,836 INFO L290 TraceCheckUtils]: 179: Hoare triple {17785#(<= |ULTIMATE.start_main_~x~0#1| 88)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17786#(<= |ULTIMATE.start_main_~x~0#1| 89)} is VALID [2022-02-21 03:36:59,837 INFO L290 TraceCheckUtils]: 180: Hoare triple {17786#(<= |ULTIMATE.start_main_~x~0#1| 89)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17786#(<= |ULTIMATE.start_main_~x~0#1| 89)} is VALID [2022-02-21 03:36:59,837 INFO L290 TraceCheckUtils]: 181: Hoare triple {17786#(<= |ULTIMATE.start_main_~x~0#1| 89)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17787#(<= |ULTIMATE.start_main_~x~0#1| 90)} is VALID [2022-02-21 03:36:59,837 INFO L290 TraceCheckUtils]: 182: Hoare triple {17787#(<= |ULTIMATE.start_main_~x~0#1| 90)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17787#(<= |ULTIMATE.start_main_~x~0#1| 90)} is VALID [2022-02-21 03:36:59,838 INFO L290 TraceCheckUtils]: 183: Hoare triple {17787#(<= |ULTIMATE.start_main_~x~0#1| 90)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17788#(<= |ULTIMATE.start_main_~x~0#1| 91)} is VALID [2022-02-21 03:36:59,838 INFO L290 TraceCheckUtils]: 184: Hoare triple {17788#(<= |ULTIMATE.start_main_~x~0#1| 91)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17788#(<= |ULTIMATE.start_main_~x~0#1| 91)} is VALID [2022-02-21 03:36:59,839 INFO L290 TraceCheckUtils]: 185: Hoare triple {17788#(<= |ULTIMATE.start_main_~x~0#1| 91)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17789#(<= |ULTIMATE.start_main_~x~0#1| 92)} is VALID [2022-02-21 03:36:59,839 INFO L290 TraceCheckUtils]: 186: Hoare triple {17789#(<= |ULTIMATE.start_main_~x~0#1| 92)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17789#(<= |ULTIMATE.start_main_~x~0#1| 92)} is VALID [2022-02-21 03:36:59,840 INFO L290 TraceCheckUtils]: 187: Hoare triple {17789#(<= |ULTIMATE.start_main_~x~0#1| 92)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17790#(<= |ULTIMATE.start_main_~x~0#1| 93)} is VALID [2022-02-21 03:36:59,840 INFO L290 TraceCheckUtils]: 188: Hoare triple {17790#(<= |ULTIMATE.start_main_~x~0#1| 93)} assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; {17790#(<= |ULTIMATE.start_main_~x~0#1| 93)} is VALID [2022-02-21 03:36:59,840 INFO L290 TraceCheckUtils]: 189: Hoare triple {17790#(<= |ULTIMATE.start_main_~x~0#1| 93)} main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {17791#(<= |ULTIMATE.start_main_~x~0#1| 94)} is VALID [2022-02-21 03:36:59,841 INFO L290 TraceCheckUtils]: 190: Hoare triple {17791#(<= |ULTIMATE.start_main_~x~0#1| 94)} assume !(main_~x~0#1 < 100000); {17696#false} is VALID [2022-02-21 03:36:59,841 INFO L290 TraceCheckUtils]: 191: Hoare triple {17696#false} main_~x~0#1 := 0; {17696#false} is VALID [2022-02-21 03:36:59,841 INFO L290 TraceCheckUtils]: 192: Hoare triple {17696#false} assume !(main_~x~0#1 < main_~n~0#1); {17696#false} is VALID [2022-02-21 03:36:59,841 INFO L290 TraceCheckUtils]: 193: Hoare triple {17696#false} call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; {17696#false} is VALID [2022-02-21 03:36:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:59,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:59,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040136532] [2022-02-21 03:36:59,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040136532] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:59,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873308276] [2022-02-21 03:36:59,845 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:36:59,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:59,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:59,864 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:59,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process