/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i


--------------------------------------------------------------------------------


This is Ultimate 0.2.2-dev-bf34d27
[2022-01-19 11:20:42,278 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-01-19 11:20:42,279 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-01-19 11:20:42,340 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-01-19 11:20:42,340 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-01-19 11:20:42,342 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-01-19 11:20:42,344 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-01-19 11:20:42,348 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-01-19 11:20:42,349 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-01-19 11:20:42,353 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-01-19 11:20:42,353 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-01-19 11:20:42,354 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-01-19 11:20:42,354 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-01-19 11:20:42,354 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-01-19 11:20:42,355 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-01-19 11:20:42,355 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-01-19 11:20:42,356 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-01-19 11:20:42,356 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-01-19 11:20:42,357 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-01-19 11:20:42,358 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-01-19 11:20:42,359 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-01-19 11:20:42,361 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-01-19 11:20:42,363 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-01-19 11:20:42,364 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-01-19 11:20:42,372 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-01-19 11:20:42,372 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-01-19 11:20:42,372 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-01-19 11:20:42,373 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-01-19 11:20:42,373 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-01-19 11:20:42,374 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-01-19 11:20:42,374 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-01-19 11:20:42,375 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-01-19 11:20:42,376 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-01-19 11:20:42,376 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-01-19 11:20:42,377 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-01-19 11:20:42,377 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-01-19 11:20:42,377 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-01-19 11:20:42,378 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-01-19 11:20:42,378 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-01-19 11:20:42,378 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-01-19 11:20:42,379 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-01-19 11:20:42,379 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf
[2022-01-19 11:20:42,403 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-01-19 11:20:42,405 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-01-19 11:20:42,406 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-01-19 11:20:42,406 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-01-19 11:20:42,406 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-01-19 11:20:42,406 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2022-01-19 11:20:42,406 INFO  L138        SettingsManager]:  * Use SBE=true
[2022-01-19 11:20:42,406 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-01-19 11:20:42,406 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-01-19 11:20:42,407 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-01-19 11:20:42,407 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-01-19 11:20:42,407 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-01-19 11:20:42,407 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-01-19 11:20:42,407 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-01-19 11:20:42,407 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-01-19 11:20:42,407 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-01-19 11:20:42,408 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-01-19 11:20:42,408 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-01-19 11:20:42,408 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-01-19 11:20:42,408 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-01-19 11:20:42,408 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-01-19 11:20:42,408 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2022-01-19 11:20:42,408 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-01-19 11:20:42,408 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-01-19 11:20:42,408 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-01-19 11:20:42,408 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2022-01-19 11:20:42,408 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-01-19 11:20:42,408 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-01-19 11:20:42,409 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-01-19 11:20:42,409 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2022-01-19 11:20:42,409 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2022-01-19 11:20:42,409 INFO  L138        SettingsManager]:  * When to check the insufficient erros location relative to the other error locations=AFTER
[2022-01-19 11:20:42,409 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
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
[2022-01-19 11:20:42,590 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-01-19 11:20:42,604 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-01-19 11:20:42,605 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-01-19 11:20:42,606 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-01-19 11:20:42,606 INFO  L275        PluginConnector]: CDTParser initialized
[2022-01-19 11:20:42,607 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i
[2022-01-19 11:20:42,649 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51d590022/7b6b45551a534b05be17209f7904df3d/FLAGdfafa5c6b
[2022-01-19 11:20:43,059 INFO  L306              CDTParser]: Found 1 translation units.
[2022-01-19 11:20:43,060 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i
[2022-01-19 11:20:43,091 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51d590022/7b6b45551a534b05be17209f7904df3d/FLAGdfafa5c6b
[2022-01-19 11:20:43,099 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51d590022/7b6b45551a534b05be17209f7904df3d
[2022-01-19 11:20:43,101 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-01-19 11:20:43,102 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2022-01-19 11:20:43,115 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-01-19 11:20:43,115 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-01-19 11:20:43,117 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-01-19 11:20:43,117 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:20:43" (1/1) ...
[2022-01-19 11:20:43,118 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75b7958f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:20:43, skipping insertion in model container
[2022-01-19 11:20:43,118 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:20:43" (1/1) ...
[2022-01-19 11:20:43,122 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-01-19 11:20:43,153 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-01-19 11:20:43,280 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i[992,1005]
[2022-01-19 11:20:43,378 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-01-19 11:20:43,383 INFO  L203         MainTranslator]: Completed pre-run
[2022-01-19 11:20:43,390 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i[992,1005]
[2022-01-19 11:20:43,422 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-01-19 11:20:43,442 INFO  L208         MainTranslator]: Completed translation
[2022-01-19 11:20:43,443 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:20:43 WrapperNode
[2022-01-19 11:20:43,443 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-01-19 11:20:43,444 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-01-19 11:20:43,444 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-01-19 11:20:43,444 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2022-01-19 11:20:43,448 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:20:43" (1/1) ...
[2022-01-19 11:20:43,459 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:20:43" (1/1) ...
[2022-01-19 11:20:43,475 INFO  L137                Inliner]: procedures = 177, calls = 86, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167
[2022-01-19 11:20:43,475 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-01-19 11:20:43,476 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-01-19 11:20:43,476 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-01-19 11:20:43,476 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-01-19 11:20:43,481 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:20:43" (1/1) ...
[2022-01-19 11:20:43,481 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:20:43" (1/1) ...
[2022-01-19 11:20:43,484 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:20:43" (1/1) ...
[2022-01-19 11:20:43,484 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:20:43" (1/1) ...
[2022-01-19 11:20:43,494 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:20:43" (1/1) ...
[2022-01-19 11:20:43,497 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:20:43" (1/1) ...
[2022-01-19 11:20:43,499 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:20:43" (1/1) ...
[2022-01-19 11:20:43,502 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-01-19 11:20:43,503 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-01-19 11:20:43,503 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-01-19 11:20:43,503 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-01-19 11:20:43,503 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:20:43" (1/1) ...
[2022-01-19 11:20:43,521 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-01-19 11:20:43,539 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-01-19 11:20:43,568 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-01-19 11:20:43,580 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-01-19 11:20:43,600 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2022-01-19 11:20:43,600 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2022-01-19 11:20:43,600 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-01-19 11:20:43,600 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-01-19 11:20:43,600 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-01-19 11:20:43,600 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-01-19 11:20:43,601 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2022-01-19 11:20:43,601 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2022-01-19 11:20:43,601 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2022-01-19 11:20:43,602 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2022-01-19 11:20:43,602 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2022-01-19 11:20:43,602 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2022-01-19 11:20:43,602 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2022-01-19 11:20:43,602 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2022-01-19 11:20:43,602 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2022-01-19 11:20:43,602 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-01-19 11:20:43,602 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-01-19 11:20:43,603 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-01-19 11:20:43,604 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-01-19 11:20:43,728 INFO  L234             CfgBuilder]: Building ICFG
[2022-01-19 11:20:43,729 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-01-19 11:20:44,248 INFO  L275             CfgBuilder]: Performing block encoding
[2022-01-19 11:20:44,565 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-01-19 11:20:44,566 INFO  L299             CfgBuilder]: Removed 0 assume(true) statements.
[2022-01-19 11:20:44,568 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:20:44 BoogieIcfgContainer
[2022-01-19 11:20:44,568 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-01-19 11:20:44,569 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-01-19 11:20:44,569 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-01-19 11:20:44,572 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-01-19 11:20:44,572 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 11:20:43" (1/3) ...
[2022-01-19 11:20:44,572 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68300eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:20:44, skipping insertion in model container
[2022-01-19 11:20:44,573 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:20:43" (2/3) ...
[2022-01-19 11:20:44,573 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68300eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:20:44, skipping insertion in model container
[2022-01-19 11:20:44,573 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:20:44" (3/3) ...
[2022-01-19 11:20:44,574 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe019_rmo.opt.i
[2022-01-19 11:20:44,579 INFO  L205   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-01-19 11:20:44,579 INFO  L164   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-01-19 11:20:44,579 INFO  L534   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-01-19 11:20:44,635 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,636 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,636 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,636 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,636 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,636 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,636 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,636 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,636 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,637 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,637 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,637 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,637 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,637 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,637 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,637 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,637 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,637 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,637 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,637 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,637 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,638 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,638 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,638 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,638 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,638 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,638 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,638 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,638 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,638 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,638 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,638 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,638 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,639 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,639 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,639 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,639 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,639 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,639 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,639 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,639 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,639 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,639 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,639 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,639 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,640 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,640 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,640 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,640 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,640 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,640 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,640 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,642 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,642 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,642 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,642 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,642 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,642 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,642 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,642 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,642 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,643 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,643 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,643 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,643 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,643 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,643 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,643 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,643 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,643 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,643 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,643 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,643 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,644 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,644 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,644 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,644 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,644 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,644 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,644 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,644 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,644 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,644 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,644 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,644 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,645 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,645 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,645 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,645 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,645 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,645 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,645 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,645 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,645 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,645 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,645 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,647 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,647 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,648 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,648 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,648 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,648 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,648 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,648 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,648 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,648 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,648 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,648 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,649 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,649 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,649 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,649 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,649 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,649 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,649 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,649 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,649 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,650 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,650 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,650 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,650 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,650 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,650 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,650 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,650 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,650 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,651 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,651 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,651 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,651 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,652 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,652 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,652 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,652 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,652 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,652 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,652 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,652 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,652 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,652 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,652 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,653 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,653 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,653 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,653 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,653 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,653 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,653 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,653 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,653 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,653 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,653 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,653 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,653 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,654 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,654 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,654 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,654 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,654 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,654 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,654 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,654 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,654 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,654 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,654 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,654 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,655 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,655 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,655 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,655 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,655 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,655 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,655 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,655 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,655 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,655 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,655 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,655 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,655 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,656 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,656 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,656 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,657 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,658 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,658 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,659 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,659 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,659 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,659 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,659 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,659 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,660 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,660 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,660 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,660 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,660 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,660 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,660 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,660 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,660 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,660 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,660 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,660 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,660 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,660 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,661 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,661 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,661 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,661 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,661 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,661 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,661 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,661 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,661 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,661 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,661 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,661 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,661 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,662 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,662 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,662 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,662 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,662 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,662 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,662 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,662 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,664 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,664 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,665 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,665 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,665 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,665 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,665 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,665 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,665 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,670 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,670 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,670 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,670 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,670 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,670 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,670 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,670 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,670 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,671 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,671 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,671 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,671 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,672 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,672 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,672 WARN  L322   ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,672 WARN  L322   ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,672 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,672 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,672 WARN  L322   ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,672 WARN  L322   ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,673 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,673 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,673 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,673 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,673 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,673 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,673 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,673 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,673 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,674 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,674 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,674 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,674 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,674 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,674 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,674 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,674 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,674 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,675 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,675 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,675 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,675 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,677 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,678 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,678 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,678 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,678 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,678 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,678 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,678 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,678 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,678 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,678 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,679 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,679 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,679 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,679 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,679 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,679 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,680 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,680 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,680 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,680 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,680 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,680 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,680 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,680 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,680 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,680 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,680 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,681 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,682 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,682 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,682 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,682 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,682 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,682 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,682 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,682 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,683 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,684 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,684 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,684 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,684 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,684 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,684 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,684 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,684 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,684 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,684 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,685 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,685 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,685 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,685 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,685 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,685 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,686 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,689 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,689 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,689 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,689 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,689 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,690 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,690 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,690 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,690 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,691 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,691 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,691 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,691 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,692 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,692 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,692 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,692 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,692 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,692 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,692 WARN  L322   ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,692 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,692 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,692 WARN  L322   ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,692 WARN  L322   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 11:20:44,693 INFO  L148    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-01-19 11:20:44,732 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-01-19 11:20:44,736 INFO  L339      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR
[2022-01-19 11:20:44,736 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2022-01-19 11:20:44,746 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow
[2022-01-19 11:20:44,799 INFO  L129       PetriNetUnfolder]: 2/147 cut-off events.
[2022-01-19 11:20:44,799 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-01-19 11:20:44,801 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. 
[2022-01-19 11:20:44,802 INFO  L82        GeneralOperation]: Start removeDead. Operand has 162 places, 151 transitions, 322 flow
[2022-01-19 11:20:44,806 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 143 places, 131 transitions, 274 flow
[2022-01-19 11:20:44,843 INFO  L129       PetriNetUnfolder]: 1/130 cut-off events.
[2022-01-19 11:20:44,844 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-01-19 11:20:44,844 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:20:44,844 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:20:44,845 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:20:44,849 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:20:44,849 INFO  L85        PathProgramCache]: Analyzing trace with hash 1022250834, now seen corresponding path program 1 times
[2022-01-19 11:20:44,854 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:20:44,855 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324602515]
[2022-01-19 11:20:44,855 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:20:44,855 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:20:45,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:20:45,213 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:20:45,214 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:20:45,214 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324602515]
[2022-01-19 11:20:45,214 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324602515] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:20:45,214 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:20:45,215 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-01-19 11:20:45,215 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753212348]
[2022-01-19 11:20:45,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:20:45,221 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-01-19 11:20:45,222 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:20:45,240 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-01-19 11:20:45,242 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-01-19 11:20:45,245 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 129 out of 151
[2022-01-19 11:20:45,249 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 131 transitions, 274 flow. Second operand  has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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-01-19 11:20:45,249 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:20:45,249 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 151
[2022-01-19 11:20:45,250 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:20:45,777 INFO  L129       PetriNetUnfolder]: 747/1559 cut-off events.
[2022-01-19 11:20:45,777 INFO  L130       PetriNetUnfolder]: For 28/28 co-relation queries the response was YES.
[2022-01-19 11:20:45,781 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2733 conditions, 1559 events. 747/1559 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9335 event pairs, 403 based on Foata normal form. 42/1544 useless extension candidates. Maximal degree in co-relation 2656. Up to 585 conditions per place. 
[2022-01-19 11:20:45,787 INFO  L132   encePairwiseOnDemand]: 144/151 looper letters, 24 selfloop transitions, 2 changer transitions 37/175 dead transitions.
[2022-01-19 11:20:45,787 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 175 transitions, 497 flow
[2022-01-19 11:20:45,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-01-19 11:20:45,790 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2022-01-19 11:20:45,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1228 transitions.
[2022-01-19 11:20:45,799 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9036055923473142
[2022-01-19 11:20:45,799 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1228 transitions.
[2022-01-19 11:20:45,799 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1228 transitions.
[2022-01-19 11:20:45,801 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:20:45,802 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1228 transitions.
[2022-01-19 11:20:45,806 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 136.44444444444446) internal successors, (1228), 9 states have internal predecessors, (1228), 0 states have call successors, (0), 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-01-19 11:20:45,812 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 151.0) internal successors, (1510), 10 states have internal predecessors, (1510), 0 states have call successors, (0), 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-01-19 11:20:45,812 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 151.0) internal successors, (1510), 10 states have internal predecessors, (1510), 0 states have call successors, (0), 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-01-19 11:20:45,813 INFO  L186             Difference]: Start difference. First operand has 143 places, 131 transitions, 274 flow. Second operand 9 states and 1228 transitions.
[2022-01-19 11:20:45,814 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 175 transitions, 497 flow
[2022-01-19 11:20:45,816 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 175 transitions, 490 flow, removed 0 selfloop flow, removed 4 redundant places.
[2022-01-19 11:20:45,818 INFO  L242             Difference]: Finished difference. Result has 154 places, 130 transitions, 288 flow
[2022-01-19 11:20:45,820 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=288, PETRI_PLACES=154, PETRI_TRANSITIONS=130}
[2022-01-19 11:20:45,821 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 11 predicate places.
[2022-01-19 11:20:45,822 INFO  L470      AbstractCegarLoop]: Abstraction has has 154 places, 130 transitions, 288 flow
[2022-01-19 11:20:45,822 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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-01-19 11:20:45,822 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:20:45,822 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:20:45,822 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-01-19 11:20:45,823 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:20:45,823 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:20:45,823 INFO  L85        PathProgramCache]: Analyzing trace with hash 963542035, now seen corresponding path program 1 times
[2022-01-19 11:20:45,823 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:20:45,823 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777591956]
[2022-01-19 11:20:45,823 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:20:45,823 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:20:45,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:20:45,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:20:45,927 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:20:45,927 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777591956]
[2022-01-19 11:20:45,927 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777591956] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:20:45,927 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:20:45,928 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-01-19 11:20:45,928 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288838558]
[2022-01-19 11:20:45,928 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:20:45,929 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-01-19 11:20:45,929 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:20:45,929 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-01-19 11:20:45,929 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-01-19 11:20:45,930 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 151
[2022-01-19 11:20:45,931 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 130 transitions, 288 flow. Second operand  has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-01-19 11:20:45,931 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:20:45,931 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 151
[2022-01-19 11:20:45,931 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:20:46,624 INFO  L129       PetriNetUnfolder]: 1436/2853 cut-off events.
[2022-01-19 11:20:46,624 INFO  L130       PetriNetUnfolder]: For 563/563 co-relation queries the response was YES.
[2022-01-19 11:20:46,634 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5682 conditions, 2853 events. 1436/2853 cut-off events. For 563/563 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 18898 event pairs, 358 based on Foata normal form. 48/2765 useless extension candidates. Maximal degree in co-relation 5599. Up to 949 conditions per place. 
[2022-01-19 11:20:46,644 INFO  L132   encePairwiseOnDemand]: 142/151 looper letters, 30 selfloop transitions, 5 changer transitions 47/191 dead transitions.
[2022-01-19 11:20:46,644 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 191 transitions, 601 flow
[2022-01-19 11:20:46,645 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2022-01-19 11:20:46,645 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-01-19 11:20:46,648 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1344 transitions.
[2022-01-19 11:20:46,649 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8900662251655629
[2022-01-19 11:20:46,649 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1344 transitions.
[2022-01-19 11:20:46,649 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1344 transitions.
[2022-01-19 11:20:46,650 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:20:46,651 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1344 transitions.
[2022-01-19 11:20:46,654 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 134.4) internal successors, (1344), 10 states have internal predecessors, (1344), 0 states have call successors, (0), 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-01-19 11:20:46,657 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 151.0) internal successors, (1661), 11 states have internal predecessors, (1661), 0 states have call successors, (0), 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-01-19 11:20:46,657 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 151.0) internal successors, (1661), 11 states have internal predecessors, (1661), 0 states have call successors, (0), 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-01-19 11:20:46,658 INFO  L186             Difference]: Start difference. First operand has 154 places, 130 transitions, 288 flow. Second operand 10 states and 1344 transitions.
[2022-01-19 11:20:46,658 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 191 transitions, 601 flow
[2022-01-19 11:20:46,678 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 191 transitions, 567 flow, removed 14 selfloop flow, removed 8 redundant places.
[2022-01-19 11:20:46,683 INFO  L242             Difference]: Finished difference. Result has 157 places, 132 transitions, 326 flow
[2022-01-19 11:20:46,683 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=326, PETRI_PLACES=157, PETRI_TRANSITIONS=132}
[2022-01-19 11:20:46,684 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 14 predicate places.
[2022-01-19 11:20:46,684 INFO  L470      AbstractCegarLoop]: Abstraction has has 157 places, 132 transitions, 326 flow
[2022-01-19 11:20:46,685 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-01-19 11:20:46,685 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:20:46,685 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:20:46,685 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-01-19 11:20:46,685 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:20:46,685 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:20:46,686 INFO  L85        PathProgramCache]: Analyzing trace with hash -1289152926, now seen corresponding path program 1 times
[2022-01-19 11:20:46,686 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:20:46,686 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028497973]
[2022-01-19 11:20:46,686 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:20:46,686 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:20:46,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:20:46,906 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:20:46,907 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:20:46,907 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028497973]
[2022-01-19 11:20:46,907 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028497973] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:20:46,908 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:20:46,908 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-01-19 11:20:46,908 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101667900]
[2022-01-19 11:20:46,908 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:20:46,909 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-01-19 11:20:46,909 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:20:46,910 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-01-19 11:20:46,910 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-01-19 11:20:46,911 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 129 out of 151
[2022-01-19 11:20:46,912 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 132 transitions, 326 flow. Second operand  has 7 states, 7 states have (on average 130.85714285714286) internal successors, (916), 7 states have internal predecessors, (916), 0 states have call successors, (0), 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-01-19 11:20:46,912 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:20:46,912 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 151
[2022-01-19 11:20:46,912 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:20:47,342 INFO  L129       PetriNetUnfolder]: 679/1478 cut-off events.
[2022-01-19 11:20:47,342 INFO  L130       PetriNetUnfolder]: For 1186/1209 co-relation queries the response was YES.
[2022-01-19 11:20:47,347 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 1478 events. 679/1478 cut-off events. For 1186/1209 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8865 event pairs, 251 based on Foata normal form. 32/1445 useless extension candidates. Maximal degree in co-relation 3252. Up to 557 conditions per place. 
[2022-01-19 11:20:47,351 INFO  L132   encePairwiseOnDemand]: 144/151 looper letters, 20 selfloop transitions, 3 changer transitions 31/168 dead transitions.
[2022-01-19 11:20:47,351 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 168 transitions, 530 flow
[2022-01-19 11:20:47,352 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2022-01-19 11:20:47,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-01-19 11:20:47,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1346 transitions.
[2022-01-19 11:20:47,354 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8913907284768212
[2022-01-19 11:20:47,354 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1346 transitions.
[2022-01-19 11:20:47,354 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1346 transitions.
[2022-01-19 11:20:47,355 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:20:47,355 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1346 transitions.
[2022-01-19 11:20:47,357 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 134.6) internal successors, (1346), 10 states have internal predecessors, (1346), 0 states have call successors, (0), 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-01-19 11:20:47,359 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 151.0) internal successors, (1661), 11 states have internal predecessors, (1661), 0 states have call successors, (0), 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-01-19 11:20:47,360 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 151.0) internal successors, (1661), 11 states have internal predecessors, (1661), 0 states have call successors, (0), 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-01-19 11:20:47,360 INFO  L186             Difference]: Start difference. First operand has 157 places, 132 transitions, 326 flow. Second operand 10 states and 1346 transitions.
[2022-01-19 11:20:47,360 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 168 transitions, 530 flow
[2022-01-19 11:20:47,364 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 168 transitions, 505 flow, removed 9 selfloop flow, removed 5 redundant places.
[2022-01-19 11:20:47,367 INFO  L242             Difference]: Finished difference. Result has 162 places, 132 transitions, 333 flow
[2022-01-19 11:20:47,367 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=333, PETRI_PLACES=162, PETRI_TRANSITIONS=132}
[2022-01-19 11:20:47,369 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 19 predicate places.
[2022-01-19 11:20:47,369 INFO  L470      AbstractCegarLoop]: Abstraction has has 162 places, 132 transitions, 333 flow
[2022-01-19 11:20:47,369 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 130.85714285714286) internal successors, (916), 7 states have internal predecessors, (916), 0 states have call successors, (0), 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-01-19 11:20:47,369 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:20:47,369 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:20:47,369 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-01-19 11:20:47,370 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:20:47,370 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:20:47,370 INFO  L85        PathProgramCache]: Analyzing trace with hash 65415168, now seen corresponding path program 1 times
[2022-01-19 11:20:47,370 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:20:47,370 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398207983]
[2022-01-19 11:20:47,370 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:20:47,370 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:20:47,455 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:20:47,536 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:20:47,537 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:20:47,537 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398207983]
[2022-01-19 11:20:47,537 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398207983] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:20:47,537 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:20:47,537 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-01-19 11:20:47,537 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089055358]
[2022-01-19 11:20:47,537 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:20:47,538 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-01-19 11:20:47,539 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:20:47,539 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-01-19 11:20:47,541 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-01-19 11:20:47,542 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 151
[2022-01-19 11:20:47,542 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 132 transitions, 333 flow. Second operand  has 7 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 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-01-19 11:20:47,542 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:20:47,543 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 151
[2022-01-19 11:20:47,543 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:20:48,206 INFO  L129       PetriNetUnfolder]: 1324/2713 cut-off events.
[2022-01-19 11:20:48,206 INFO  L130       PetriNetUnfolder]: For 2597/2613 co-relation queries the response was YES.
[2022-01-19 11:20:48,215 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 6346 conditions, 2713 events. 1324/2713 cut-off events. For 2597/2613 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18957 event pairs, 350 based on Foata normal form. 56/2686 useless extension candidates. Maximal degree in co-relation 6255. Up to 641 conditions per place. 
[2022-01-19 11:20:48,221 INFO  L132   encePairwiseOnDemand]: 144/151 looper letters, 30 selfloop transitions, 3 changer transitions 64/206 dead transitions.
[2022-01-19 11:20:48,221 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 206 transitions, 785 flow
[2022-01-19 11:20:48,221 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-01-19 11:20:48,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2022-01-19 11:20:48,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1863 transitions.
[2022-01-19 11:20:48,224 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.881267738883633
[2022-01-19 11:20:48,224 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1863 transitions.
[2022-01-19 11:20:48,224 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1863 transitions.
[2022-01-19 11:20:48,225 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:20:48,225 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1863 transitions.
[2022-01-19 11:20:48,227 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 133.07142857142858) internal successors, (1863), 14 states have internal predecessors, (1863), 0 states have call successors, (0), 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-01-19 11:20:48,229 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 151.0) internal successors, (2265), 15 states have internal predecessors, (2265), 0 states have call successors, (0), 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-01-19 11:20:48,230 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 151.0) internal successors, (2265), 15 states have internal predecessors, (2265), 0 states have call successors, (0), 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-01-19 11:20:48,230 INFO  L186             Difference]: Start difference. First operand has 162 places, 132 transitions, 333 flow. Second operand 14 states and 1863 transitions.
[2022-01-19 11:20:48,230 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 206 transitions, 785 flow
[2022-01-19 11:20:48,239 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 206 transitions, 721 flow, removed 29 selfloop flow, removed 9 redundant places.
[2022-01-19 11:20:48,240 INFO  L242             Difference]: Finished difference. Result has 172 places, 132 transitions, 348 flow
[2022-01-19 11:20:48,240 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=348, PETRI_PLACES=172, PETRI_TRANSITIONS=132}
[2022-01-19 11:20:48,241 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 29 predicate places.
[2022-01-19 11:20:48,241 INFO  L470      AbstractCegarLoop]: Abstraction has has 172 places, 132 transitions, 348 flow
[2022-01-19 11:20:48,241 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 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-01-19 11:20:48,241 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:20:48,241 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:20:48,242 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-01-19 11:20:48,242 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:20:48,242 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:20:48,242 INFO  L85        PathProgramCache]: Analyzing trace with hash 1248499279, now seen corresponding path program 1 times
[2022-01-19 11:20:48,242 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:20:48,242 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194917571]
[2022-01-19 11:20:48,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:20:48,242 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:20:48,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:20:48,319 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:20:48,319 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:20:48,319 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194917571]
[2022-01-19 11:20:48,319 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194917571] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:20:48,319 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:20:48,320 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-01-19 11:20:48,320 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649111484]
[2022-01-19 11:20:48,320 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:20:48,320 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-01-19 11:20:48,320 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:20:48,320 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-01-19 11:20:48,320 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-01-19 11:20:48,321 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 151
[2022-01-19 11:20:48,321 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 132 transitions, 348 flow. Second operand  has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 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-01-19 11:20:48,321 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:20:48,321 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 151
[2022-01-19 11:20:48,321 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:20:49,576 INFO  L129       PetriNetUnfolder]: 6044/10578 cut-off events.
[2022-01-19 11:20:49,576 INFO  L130       PetriNetUnfolder]: For 4484/4549 co-relation queries the response was YES.
[2022-01-19 11:20:49,605 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 21787 conditions, 10578 events. 6044/10578 cut-off events. For 4484/4549 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 81269 event pairs, 313 based on Foata normal form. 0/10194 useless extension candidates. Maximal degree in co-relation 21693. Up to 3807 conditions per place. 
[2022-01-19 11:20:49,623 INFO  L132   encePairwiseOnDemand]: 140/151 looper letters, 35 selfloop transitions, 7 changer transitions 55/206 dead transitions.
[2022-01-19 11:20:49,623 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 206 transitions, 701 flow
[2022-01-19 11:20:49,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2022-01-19 11:20:49,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-01-19 11:20:49,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1349 transitions.
[2022-01-19 11:20:49,626 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8933774834437086
[2022-01-19 11:20:49,626 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1349 transitions.
[2022-01-19 11:20:49,626 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1349 transitions.
[2022-01-19 11:20:49,626 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:20:49,626 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1349 transitions.
[2022-01-19 11:20:49,628 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 134.9) internal successors, (1349), 10 states have internal predecessors, (1349), 0 states have call successors, (0), 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-01-19 11:20:49,629 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 151.0) internal successors, (1661), 11 states have internal predecessors, (1661), 0 states have call successors, (0), 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-01-19 11:20:49,630 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 151.0) internal successors, (1661), 11 states have internal predecessors, (1661), 0 states have call successors, (0), 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-01-19 11:20:49,630 INFO  L186             Difference]: Start difference. First operand has 172 places, 132 transitions, 348 flow. Second operand 10 states and 1349 transitions.
[2022-01-19 11:20:49,630 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 206 transitions, 701 flow
[2022-01-19 11:20:49,645 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 206 transitions, 670 flow, removed 14 selfloop flow, removed 12 redundant places.
[2022-01-19 11:20:49,647 INFO  L242             Difference]: Finished difference. Result has 164 places, 135 transitions, 383 flow
[2022-01-19 11:20:49,647 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=383, PETRI_PLACES=164, PETRI_TRANSITIONS=135}
[2022-01-19 11:20:49,647 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 21 predicate places.
[2022-01-19 11:20:49,647 INFO  L470      AbstractCegarLoop]: Abstraction has has 164 places, 135 transitions, 383 flow
[2022-01-19 11:20:49,648 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 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-01-19 11:20:49,648 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:20:49,648 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:20:49,648 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-01-19 11:20:49,648 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:20:49,648 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:20:49,648 INFO  L85        PathProgramCache]: Analyzing trace with hash -1132584464, now seen corresponding path program 1 times
[2022-01-19 11:20:49,649 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:20:49,649 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411254026]
[2022-01-19 11:20:49,649 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:20:49,649 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:20:49,685 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:20:49,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:20:49,739 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:20:49,739 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411254026]
[2022-01-19 11:20:49,739 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411254026] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:20:49,739 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:20:49,739 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-01-19 11:20:49,740 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233246893]
[2022-01-19 11:20:49,740 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:20:49,740 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-01-19 11:20:49,740 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:20:49,740 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-01-19 11:20:49,740 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-01-19 11:20:49,741 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 151
[2022-01-19 11:20:49,742 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 135 transitions, 383 flow. Second operand  has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 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-01-19 11:20:49,742 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:20:49,742 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 151
[2022-01-19 11:20:49,742 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:20:50,691 INFO  L129       PetriNetUnfolder]: 2711/5298 cut-off events.
[2022-01-19 11:20:50,691 INFO  L130       PetriNetUnfolder]: For 7243/7414 co-relation queries the response was YES.
[2022-01-19 11:20:50,707 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 15782 conditions, 5298 events. 2711/5298 cut-off events. For 7243/7414 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 39674 event pairs, 83 based on Foata normal form. 162/5365 useless extension candidates. Maximal degree in co-relation 15691. Up to 1675 conditions per place. 
[2022-01-19 11:20:50,717 INFO  L132   encePairwiseOnDemand]: 141/151 looper letters, 41 selfloop transitions, 11 changer transitions 43/204 dead transitions.
[2022-01-19 11:20:50,717 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 204 transitions, 887 flow
[2022-01-19 11:20:50,717 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2022-01-19 11:20:50,717 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-01-19 11:20:50,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1347 transitions.
[2022-01-19 11:20:50,719 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8920529801324504
[2022-01-19 11:20:50,719 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1347 transitions.
[2022-01-19 11:20:50,720 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1347 transitions.
[2022-01-19 11:20:50,720 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:20:50,720 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1347 transitions.
[2022-01-19 11:20:50,722 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 134.7) internal successors, (1347), 10 states have internal predecessors, (1347), 0 states have call successors, (0), 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-01-19 11:20:50,724 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 151.0) internal successors, (1661), 11 states have internal predecessors, (1661), 0 states have call successors, (0), 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-01-19 11:20:50,724 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 151.0) internal successors, (1661), 11 states have internal predecessors, (1661), 0 states have call successors, (0), 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-01-19 11:20:50,724 INFO  L186             Difference]: Start difference. First operand has 164 places, 135 transitions, 383 flow. Second operand 10 states and 1347 transitions.
[2022-01-19 11:20:50,724 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 204 transitions, 887 flow
[2022-01-19 11:20:50,741 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 204 transitions, 862 flow, removed 7 selfloop flow, removed 5 redundant places.
[2022-01-19 11:20:50,743 INFO  L242             Difference]: Finished difference. Result has 168 places, 139 transitions, 471 flow
[2022-01-19 11:20:50,743 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=471, PETRI_PLACES=168, PETRI_TRANSITIONS=139}
[2022-01-19 11:20:50,744 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 25 predicate places.
[2022-01-19 11:20:50,744 INFO  L470      AbstractCegarLoop]: Abstraction has has 168 places, 139 transitions, 471 flow
[2022-01-19 11:20:50,744 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 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-01-19 11:20:50,744 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:20:50,744 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:20:50,744 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-01-19 11:20:50,744 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:20:50,745 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:20:50,745 INFO  L85        PathProgramCache]: Analyzing trace with hash 810570767, now seen corresponding path program 1 times
[2022-01-19 11:20:50,745 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:20:50,745 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076009121]
[2022-01-19 11:20:50,745 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:20:50,745 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:20:50,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:20:51,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:20:51,096 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:20:51,096 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076009121]
[2022-01-19 11:20:51,096 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076009121] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:20:51,096 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:20:51,096 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-01-19 11:20:51,097 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822469234]
[2022-01-19 11:20:51,100 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:20:51,101 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-01-19 11:20:51,101 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:20:51,101 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-01-19 11:20:51,102 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2022-01-19 11:20:51,103 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 115 out of 151
[2022-01-19 11:20:51,105 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 139 transitions, 471 flow. Second operand  has 13 states, 13 states have (on average 117.23076923076923) internal successors, (1524), 13 states have internal predecessors, (1524), 0 states have call successors, (0), 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-01-19 11:20:51,105 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:20:51,105 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 151
[2022-01-19 11:20:51,105 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:20:51,899 INFO  L129       PetriNetUnfolder]: 1376/4328 cut-off events.
[2022-01-19 11:20:51,899 INFO  L130       PetriNetUnfolder]: For 9986/10514 co-relation queries the response was YES.
[2022-01-19 11:20:51,925 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 13151 conditions, 4328 events. 1376/4328 cut-off events. For 9986/10514 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 40101 event pairs, 467 based on Foata normal form. 74/4229 useless extension candidates. Maximal degree in co-relation 13045. Up to 976 conditions per place. 
[2022-01-19 11:20:51,939 INFO  L132   encePairwiseOnDemand]: 138/151 looper letters, 53 selfloop transitions, 26 changer transitions 0/186 dead transitions.
[2022-01-19 11:20:51,939 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 186 transitions, 754 flow
[2022-01-19 11:20:51,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-01-19 11:20:51,951 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2022-01-19 11:20:51,953 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1691 transitions.
[2022-01-19 11:20:51,954 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7999053926206244
[2022-01-19 11:20:51,954 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1691 transitions.
[2022-01-19 11:20:51,954 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1691 transitions.
[2022-01-19 11:20:51,954 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:20:51,955 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1691 transitions.
[2022-01-19 11:20:51,957 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 120.78571428571429) internal successors, (1691), 14 states have internal predecessors, (1691), 0 states have call successors, (0), 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-01-19 11:20:51,959 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 151.0) internal successors, (2265), 15 states have internal predecessors, (2265), 0 states have call successors, (0), 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-01-19 11:20:51,959 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 151.0) internal successors, (2265), 15 states have internal predecessors, (2265), 0 states have call successors, (0), 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-01-19 11:20:51,959 INFO  L186             Difference]: Start difference. First operand has 168 places, 139 transitions, 471 flow. Second operand 14 states and 1691 transitions.
[2022-01-19 11:20:51,960 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 186 transitions, 754 flow
[2022-01-19 11:20:52,000 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 186 transitions, 685 flow, removed 25 selfloop flow, removed 9 redundant places.
[2022-01-19 11:20:52,002 INFO  L242             Difference]: Finished difference. Result has 176 places, 169 transitions, 608 flow
[2022-01-19 11:20:52,002 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=608, PETRI_PLACES=176, PETRI_TRANSITIONS=169}
[2022-01-19 11:20:52,003 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 33 predicate places.
[2022-01-19 11:20:52,003 INFO  L470      AbstractCegarLoop]: Abstraction has has 176 places, 169 transitions, 608 flow
[2022-01-19 11:20:52,003 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 117.23076923076923) internal successors, (1524), 13 states have internal predecessors, (1524), 0 states have call successors, (0), 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-01-19 11:20:52,003 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:20:52,003 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:20:52,004 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-01-19 11:20:52,004 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:20:52,004 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:20:52,004 INFO  L85        PathProgramCache]: Analyzing trace with hash 1022891545, now seen corresponding path program 2 times
[2022-01-19 11:20:52,004 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:20:52,004 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421332446]
[2022-01-19 11:20:52,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:20:52,004 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:20:52,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:20:52,283 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:20:52,284 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:20:52,284 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421332446]
[2022-01-19 11:20:52,284 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421332446] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:20:52,284 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:20:52,284 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-01-19 11:20:52,284 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754657942]
[2022-01-19 11:20:52,284 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:20:52,284 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-01-19 11:20:52,284 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:20:52,285 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-01-19 11:20:52,285 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182
[2022-01-19 11:20:52,286 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 151
[2022-01-19 11:20:52,287 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 169 transitions, 608 flow. Second operand  has 14 states, 14 states have (on average 116.14285714285714) internal successors, (1626), 14 states have internal predecessors, (1626), 0 states have call successors, (0), 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-01-19 11:20:52,287 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:20:52,287 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 151
[2022-01-19 11:20:52,287 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:20:53,213 INFO  L129       PetriNetUnfolder]: 1725/5184 cut-off events.
[2022-01-19 11:20:53,213 INFO  L130       PetriNetUnfolder]: For 9244/9515 co-relation queries the response was YES.
[2022-01-19 11:20:53,232 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 15239 conditions, 5184 events. 1725/5184 cut-off events. For 9244/9515 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 49309 event pairs, 633 based on Foata normal form. 87/5024 useless extension candidates. Maximal degree in co-relation 15127. Up to 1668 conditions per place. 
[2022-01-19 11:20:53,243 INFO  L132   encePairwiseOnDemand]: 136/151 looper letters, 75 selfloop transitions, 41 changer transitions 0/222 dead transitions.
[2022-01-19 11:20:53,244 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 222 transitions, 1091 flow
[2022-01-19 11:20:53,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2022-01-19 11:20:53,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2022-01-19 11:20:53,246 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1798 transitions.
[2022-01-19 11:20:53,247 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7938189845474614
[2022-01-19 11:20:53,247 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1798 transitions.
[2022-01-19 11:20:53,247 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1798 transitions.
[2022-01-19 11:20:53,247 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:20:53,247 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1798 transitions.
[2022-01-19 11:20:53,250 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 119.86666666666666) internal successors, (1798), 15 states have internal predecessors, (1798), 0 states have call successors, (0), 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-01-19 11:20:53,252 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 151.0) internal successors, (2416), 16 states have internal predecessors, (2416), 0 states have call successors, (0), 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-01-19 11:20:53,252 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 151.0) internal successors, (2416), 16 states have internal predecessors, (2416), 0 states have call successors, (0), 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-01-19 11:20:53,252 INFO  L186             Difference]: Start difference. First operand has 176 places, 169 transitions, 608 flow. Second operand 15 states and 1798 transitions.
[2022-01-19 11:20:53,253 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 222 transitions, 1091 flow
[2022-01-19 11:20:53,275 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 222 transitions, 1080 flow, removed 2 selfloop flow, removed 4 redundant places.
[2022-01-19 11:20:53,277 INFO  L242             Difference]: Finished difference. Result has 194 places, 191 transitions, 883 flow
[2022-01-19 11:20:53,277 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=883, PETRI_PLACES=194, PETRI_TRANSITIONS=191}
[2022-01-19 11:20:53,278 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 51 predicate places.
[2022-01-19 11:20:53,278 INFO  L470      AbstractCegarLoop]: Abstraction has has 194 places, 191 transitions, 883 flow
[2022-01-19 11:20:53,278 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 116.14285714285714) internal successors, (1626), 14 states have internal predecessors, (1626), 0 states have call successors, (0), 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-01-19 11:20:53,278 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:20:53,278 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:20:53,278 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-01-19 11:20:53,279 INFO  L402      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:20:53,279 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:20:53,279 INFO  L85        PathProgramCache]: Analyzing trace with hash -1762770895, now seen corresponding path program 3 times
[2022-01-19 11:20:53,279 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:20:53,279 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240816199]
[2022-01-19 11:20:53,279 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:20:53,279 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:20:53,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:20:53,947 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:20:53,948 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:20:53,948 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240816199]
[2022-01-19 11:20:53,948 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240816199] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:20:53,948 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:20:53,948 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2022-01-19 11:20:53,948 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735193234]
[2022-01-19 11:20:53,948 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:20:53,948 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2022-01-19 11:20:53,948 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:20:53,949 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2022-01-19 11:20:53,949 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506
[2022-01-19 11:20:53,950 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 151
[2022-01-19 11:20:53,951 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 191 transitions, 883 flow. Second operand  has 23 states, 23 states have (on average 95.82608695652173) internal successors, (2204), 23 states have internal predecessors, (2204), 0 states have call successors, (0), 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-01-19 11:20:53,951 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:20:53,951 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 151
[2022-01-19 11:20:53,951 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:20:55,466 INFO  L129       PetriNetUnfolder]: 1927/5751 cut-off events.
[2022-01-19 11:20:55,466 INFO  L130       PetriNetUnfolder]: For 16865/17146 co-relation queries the response was YES.
[2022-01-19 11:20:55,491 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 19490 conditions, 5751 events. 1927/5751 cut-off events. For 16865/17146 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 55057 event pairs, 764 based on Foata normal form. 78/5545 useless extension candidates. Maximal degree in co-relation 19359. Up to 2283 conditions per place. 
[2022-01-19 11:20:55,508 INFO  L132   encePairwiseOnDemand]: 128/151 looper letters, 101 selfloop transitions, 33 changer transitions 34/262 dead transitions.
[2022-01-19 11:20:55,508 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 262 transitions, 1670 flow
[2022-01-19 11:20:55,509 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2022-01-19 11:20:55,509 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2022-01-19 11:20:55,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2751 transitions.
[2022-01-19 11:20:55,513 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.6506622516556292
[2022-01-19 11:20:55,513 INFO  L72            ComplementDD]: Start complementDD. Operand 28 states and 2751 transitions.
[2022-01-19 11:20:55,513 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 28 states and 2751 transitions.
[2022-01-19 11:20:55,514 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:20:55,514 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2751 transitions.
[2022-01-19 11:20:55,518 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 29 states, 28 states have (on average 98.25) internal successors, (2751), 28 states have internal predecessors, (2751), 0 states have call successors, (0), 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-01-19 11:20:55,522 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 29 states, 29 states have (on average 151.0) internal successors, (4379), 29 states have internal predecessors, (4379), 0 states have call successors, (0), 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-01-19 11:20:55,523 INFO  L81            ComplementDD]: Finished complementDD. Result  has 29 states, 29 states have (on average 151.0) internal successors, (4379), 29 states have internal predecessors, (4379), 0 states have call successors, (0), 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-01-19 11:20:55,523 INFO  L186             Difference]: Start difference. First operand has 194 places, 191 transitions, 883 flow. Second operand 28 states and 2751 transitions.
[2022-01-19 11:20:55,523 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 262 transitions, 1670 flow
[2022-01-19 11:20:55,585 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 262 transitions, 1639 flow, removed 11 selfloop flow, removed 5 redundant places.
[2022-01-19 11:20:55,587 INFO  L242             Difference]: Finished difference. Result has 231 places, 213 transitions, 1154 flow
[2022-01-19 11:20:55,588 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1154, PETRI_PLACES=231, PETRI_TRANSITIONS=213}
[2022-01-19 11:20:55,588 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 88 predicate places.
[2022-01-19 11:20:55,588 INFO  L470      AbstractCegarLoop]: Abstraction has has 231 places, 213 transitions, 1154 flow
[2022-01-19 11:20:55,589 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 95.82608695652173) internal successors, (2204), 23 states have internal predecessors, (2204), 0 states have call successors, (0), 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-01-19 11:20:55,589 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:20:55,589 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:20:55,589 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-01-19 11:20:55,589 INFO  L402      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:20:55,589 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:20:55,589 INFO  L85        PathProgramCache]: Analyzing trace with hash -1574289521, now seen corresponding path program 4 times
[2022-01-19 11:20:55,590 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:20:55,590 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841076742]
[2022-01-19 11:20:55,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:20:55,590 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:20:55,634 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:20:56,328 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:20:56,328 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:20:56,328 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841076742]
[2022-01-19 11:20:56,328 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841076742] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:20:56,328 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:20:56,328 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2022-01-19 11:20:56,328 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349579452]
[2022-01-19 11:20:56,328 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:20:56,329 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2022-01-19 11:20:56,330 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:20:56,330 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2022-01-19 11:20:56,330 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506
[2022-01-19 11:20:56,331 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 151
[2022-01-19 11:20:56,333 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 213 transitions, 1154 flow. Second operand  has 23 states, 23 states have (on average 95.82608695652173) internal successors, (2204), 23 states have internal predecessors, (2204), 0 states have call successors, (0), 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-01-19 11:20:56,333 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:20:56,333 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 151
[2022-01-19 11:20:56,333 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:20:58,775 INFO  L129       PetriNetUnfolder]: 2286/6866 cut-off events.
[2022-01-19 11:20:58,775 INFO  L130       PetriNetUnfolder]: For 37878/38209 co-relation queries the response was YES.
[2022-01-19 11:20:58,824 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 26647 conditions, 6866 events. 2286/6866 cut-off events. For 37878/38209 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 68217 event pairs, 738 based on Foata normal form. 144/6686 useless extension candidates. Maximal degree in co-relation 26495. Up to 2323 conditions per place. 
[2022-01-19 11:20:58,855 INFO  L132   encePairwiseOnDemand]: 126/151 looper letters, 103 selfloop transitions, 94 changer transitions 23/314 dead transitions.
[2022-01-19 11:20:58,855 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 314 transitions, 2540 flow
[2022-01-19 11:20:58,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 
[2022-01-19 11:20:58,856 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2022-01-19 11:20:58,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3539 transitions.
[2022-01-19 11:20:58,861 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.6510301692420898
[2022-01-19 11:20:58,861 INFO  L72            ComplementDD]: Start complementDD. Operand 36 states and 3539 transitions.
[2022-01-19 11:20:58,861 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 36 states and 3539 transitions.
[2022-01-19 11:20:58,862 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:20:58,862 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3539 transitions.
[2022-01-19 11:20:58,866 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 37 states, 36 states have (on average 98.30555555555556) internal successors, (3539), 36 states have internal predecessors, (3539), 0 states have call successors, (0), 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-01-19 11:20:58,871 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 37 states, 37 states have (on average 151.0) internal successors, (5587), 37 states have internal predecessors, (5587), 0 states have call successors, (0), 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-01-19 11:20:58,872 INFO  L81            ComplementDD]: Finished complementDD. Result  has 37 states, 37 states have (on average 151.0) internal successors, (5587), 37 states have internal predecessors, (5587), 0 states have call successors, (0), 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-01-19 11:20:58,872 INFO  L186             Difference]: Start difference. First operand has 231 places, 213 transitions, 1154 flow. Second operand 36 states and 3539 transitions.
[2022-01-19 11:20:58,872 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 314 transitions, 2540 flow
[2022-01-19 11:20:58,983 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 314 transitions, 2408 flow, removed 56 selfloop flow, removed 16 redundant places.
[2022-01-19 11:20:58,987 INFO  L242             Difference]: Finished difference. Result has 251 places, 269 transitions, 2088 flow
[2022-01-19 11:20:58,988 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2088, PETRI_PLACES=251, PETRI_TRANSITIONS=269}
[2022-01-19 11:20:58,990 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 108 predicate places.
[2022-01-19 11:20:58,990 INFO  L470      AbstractCegarLoop]: Abstraction has has 251 places, 269 transitions, 2088 flow
[2022-01-19 11:20:58,990 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 95.82608695652173) internal successors, (2204), 23 states have internal predecessors, (2204), 0 states have call successors, (0), 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-01-19 11:20:58,991 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:20:58,991 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:20:58,991 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-01-19 11:20:58,991 INFO  L402      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:20:58,991 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:20:58,991 INFO  L85        PathProgramCache]: Analyzing trace with hash -2060698087, now seen corresponding path program 1 times
[2022-01-19 11:20:58,991 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:20:58,992 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770935762]
[2022-01-19 11:20:58,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:20:58,992 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:20:59,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:20:59,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:20:59,092 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:20:59,092 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770935762]
[2022-01-19 11:20:59,092 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770935762] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:20:59,093 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:20:59,093 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-01-19 11:20:59,093 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043551869]
[2022-01-19 11:20:59,093 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:20:59,093 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-01-19 11:20:59,093 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:20:59,094 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-01-19 11:20:59,094 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2022-01-19 11:20:59,095 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 151
[2022-01-19 11:20:59,095 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 269 transitions, 2088 flow. Second operand  has 8 states, 8 states have (on average 127.25) internal successors, (1018), 8 states have internal predecessors, (1018), 0 states have call successors, (0), 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-01-19 11:20:59,096 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:20:59,096 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 151
[2022-01-19 11:20:59,096 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:21:00,259 INFO  L129       PetriNetUnfolder]: 2993/6817 cut-off events.
[2022-01-19 11:21:00,259 INFO  L130       PetriNetUnfolder]: For 36956/37658 co-relation queries the response was YES.
[2022-01-19 11:21:00,296 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 29339 conditions, 6817 events. 2993/6817 cut-off events. For 36956/37658 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 58148 event pairs, 95 based on Foata normal form. 394/7095 useless extension candidates. Maximal degree in co-relation 29203. Up to 1540 conditions per place. 
[2022-01-19 11:21:00,334 INFO  L132   encePairwiseOnDemand]: 141/151 looper letters, 162 selfloop transitions, 25 changer transitions 115/438 dead transitions.
[2022-01-19 11:21:00,334 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 438 transitions, 4367 flow
[2022-01-19 11:21:00,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2022-01-19 11:21:00,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2022-01-19 11:21:00,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1481 transitions.
[2022-01-19 11:21:00,336 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8916315472606864
[2022-01-19 11:21:00,336 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1481 transitions.
[2022-01-19 11:21:00,336 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1481 transitions.
[2022-01-19 11:21:00,336 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:21:00,336 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1481 transitions.
[2022-01-19 11:21:00,338 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 134.63636363636363) internal successors, (1481), 11 states have internal predecessors, (1481), 0 states have call successors, (0), 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-01-19 11:21:00,339 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 151.0) internal successors, (1812), 12 states have internal predecessors, (1812), 0 states have call successors, (0), 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-01-19 11:21:00,339 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 151.0) internal successors, (1812), 12 states have internal predecessors, (1812), 0 states have call successors, (0), 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-01-19 11:21:00,339 INFO  L186             Difference]: Start difference. First operand has 251 places, 269 transitions, 2088 flow. Second operand 11 states and 1481 transitions.
[2022-01-19 11:21:00,339 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 438 transitions, 4367 flow
[2022-01-19 11:21:00,396 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 438 transitions, 3646 flow, removed 337 selfloop flow, removed 26 redundant places.
[2022-01-19 11:21:00,399 INFO  L242             Difference]: Finished difference. Result has 228 places, 221 transitions, 1308 flow
[2022-01-19 11:21:00,399 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1308, PETRI_PLACES=228, PETRI_TRANSITIONS=221}
[2022-01-19 11:21:00,399 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 85 predicate places.
[2022-01-19 11:21:00,399 INFO  L470      AbstractCegarLoop]: Abstraction has has 228 places, 221 transitions, 1308 flow
[2022-01-19 11:21:00,400 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 127.25) internal successors, (1018), 8 states have internal predecessors, (1018), 0 states have call successors, (0), 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-01-19 11:21:00,400 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:21:00,400 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:21:00,400 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-01-19 11:21:00,400 INFO  L402      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:21:00,400 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:21:00,400 INFO  L85        PathProgramCache]: Analyzing trace with hash 833367974, now seen corresponding path program 1 times
[2022-01-19 11:21:00,400 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:21:00,400 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062787614]
[2022-01-19 11:21:00,401 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:21:00,401 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:21:00,453 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:21:01,615 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:21:01,615 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:21:01,615 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062787614]
[2022-01-19 11:21:01,615 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062787614] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:21:01,615 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:21:01,615 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-01-19 11:21:01,615 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872358828]
[2022-01-19 11:21:01,615 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:21:01,616 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-01-19 11:21:01,616 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:21:01,616 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-01-19 11:21:01,616 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702
[2022-01-19 11:21:01,617 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 151
[2022-01-19 11:21:01,619 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 221 transitions, 1308 flow. Second operand  has 27 states, 27 states have (on average 92.70370370370371) internal successors, (2503), 27 states have internal predecessors, (2503), 0 states have call successors, (0), 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-01-19 11:21:01,619 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:21:01,619 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 151
[2022-01-19 11:21:01,619 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:21:03,330 INFO  L129       PetriNetUnfolder]: 1637/5455 cut-off events.
[2022-01-19 11:21:03,330 INFO  L130       PetriNetUnfolder]: For 19143/19671 co-relation queries the response was YES.
[2022-01-19 11:21:03,357 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 19745 conditions, 5455 events. 1637/5455 cut-off events. For 19143/19671 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 56751 event pairs, 357 based on Foata normal form. 25/5258 useless extension candidates. Maximal degree in co-relation 19601. Up to 1384 conditions per place. 
[2022-01-19 11:21:03,370 INFO  L132   encePairwiseOnDemand]: 125/151 looper letters, 91 selfloop transitions, 51 changer transitions 13/264 dead transitions.
[2022-01-19 11:21:03,370 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 264 transitions, 1969 flow
[2022-01-19 11:21:03,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2022-01-19 11:21:03,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2022-01-19 11:21:03,372 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2738 transitions.
[2022-01-19 11:21:03,373 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.6252569079698561
[2022-01-19 11:21:03,373 INFO  L72            ComplementDD]: Start complementDD. Operand 29 states and 2738 transitions.
[2022-01-19 11:21:03,373 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 29 states and 2738 transitions.
[2022-01-19 11:21:03,374 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:21:03,374 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2738 transitions.
[2022-01-19 11:21:03,377 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 30 states, 29 states have (on average 94.41379310344827) internal successors, (2738), 29 states have internal predecessors, (2738), 0 states have call successors, (0), 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-01-19 11:21:03,381 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 30 states, 30 states have (on average 151.0) internal successors, (4530), 30 states have internal predecessors, (4530), 0 states have call successors, (0), 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-01-19 11:21:03,381 INFO  L81            ComplementDD]: Finished complementDD. Result  has 30 states, 30 states have (on average 151.0) internal successors, (4530), 30 states have internal predecessors, (4530), 0 states have call successors, (0), 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-01-19 11:21:03,381 INFO  L186             Difference]: Start difference. First operand has 228 places, 221 transitions, 1308 flow. Second operand 29 states and 2738 transitions.
[2022-01-19 11:21:03,381 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 264 transitions, 1969 flow
[2022-01-19 11:21:03,550 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 264 transitions, 1828 flow, removed 63 selfloop flow, removed 10 redundant places.
[2022-01-19 11:21:03,552 INFO  L242             Difference]: Finished difference. Result has 242 places, 240 transitions, 1507 flow
[2022-01-19 11:21:03,553 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1507, PETRI_PLACES=242, PETRI_TRANSITIONS=240}
[2022-01-19 11:21:03,553 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 99 predicate places.
[2022-01-19 11:21:03,553 INFO  L470      AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 1507 flow
[2022-01-19 11:21:03,554 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 92.70370370370371) internal successors, (2503), 27 states have internal predecessors, (2503), 0 states have call successors, (0), 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-01-19 11:21:03,554 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:21:03,554 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:21:03,554 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-01-19 11:21:03,554 INFO  L402      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:21:03,554 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:21:03,554 INFO  L85        PathProgramCache]: Analyzing trace with hash -742659332, now seen corresponding path program 2 times
[2022-01-19 11:21:03,554 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:21:03,554 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861157339]
[2022-01-19 11:21:03,554 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:21:03,554 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:21:03,603 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:21:05,148 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:21:05,148 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:21:05,148 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861157339]
[2022-01-19 11:21:05,148 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861157339] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:21:05,148 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:21:05,148 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35
[2022-01-19 11:21:05,148 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505073104]
[2022-01-19 11:21:05,148 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:21:05,149 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2022-01-19 11:21:05,149 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:21:05,149 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2022-01-19 11:21:05,149 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190
[2022-01-19 11:21:05,151 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 151
[2022-01-19 11:21:05,152 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 240 transitions, 1507 flow. Second operand  has 35 states, 35 states have (on average 83.57142857142857) internal successors, (2925), 35 states have internal predecessors, (2925), 0 states have call successors, (0), 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-01-19 11:21:05,152 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:21:05,153 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 151
[2022-01-19 11:21:05,153 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:21:08,564 INFO  L129       PetriNetUnfolder]: 2177/7462 cut-off events.
[2022-01-19 11:21:08,564 INFO  L130       PetriNetUnfolder]: For 17619/18182 co-relation queries the response was YES.
[2022-01-19 11:21:08,607 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 23028 conditions, 7462 events. 2177/7462 cut-off events. For 17619/18182 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 84600 event pairs, 373 based on Foata normal form. 66/7269 useless extension candidates. Maximal degree in co-relation 22869. Up to 1389 conditions per place. 
[2022-01-19 11:21:08,624 INFO  L132   encePairwiseOnDemand]: 117/151 looper letters, 123 selfloop transitions, 100 changer transitions 36/359 dead transitions.
[2022-01-19 11:21:08,624 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 359 transitions, 3060 flow
[2022-01-19 11:21:08,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. 
[2022-01-19 11:21:08,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 46 states.
[2022-01-19 11:21:08,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 3942 transitions.
[2022-01-19 11:21:08,628 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.5675208753239275
[2022-01-19 11:21:08,628 INFO  L72            ComplementDD]: Start complementDD. Operand 46 states and 3942 transitions.
[2022-01-19 11:21:08,628 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 46 states and 3942 transitions.
[2022-01-19 11:21:08,629 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:21:08,629 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 3942 transitions.
[2022-01-19 11:21:08,633 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 47 states, 46 states have (on average 85.69565217391305) internal successors, (3942), 46 states have internal predecessors, (3942), 0 states have call successors, (0), 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-01-19 11:21:08,638 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 47 states, 47 states have (on average 151.0) internal successors, (7097), 47 states have internal predecessors, (7097), 0 states have call successors, (0), 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-01-19 11:21:08,639 INFO  L81            ComplementDD]: Finished complementDD. Result  has 47 states, 47 states have (on average 151.0) internal successors, (7097), 47 states have internal predecessors, (7097), 0 states have call successors, (0), 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-01-19 11:21:08,639 INFO  L186             Difference]: Start difference. First operand has 242 places, 240 transitions, 1507 flow. Second operand 46 states and 3942 transitions.
[2022-01-19 11:21:08,639 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 359 transitions, 3060 flow
[2022-01-19 11:21:08,773 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 359 transitions, 2916 flow, removed 54 selfloop flow, removed 21 redundant places.
[2022-01-19 11:21:08,777 INFO  L242             Difference]: Finished difference. Result has 280 places, 283 transitions, 2157 flow
[2022-01-19 11:21:08,777 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=2157, PETRI_PLACES=280, PETRI_TRANSITIONS=283}
[2022-01-19 11:21:08,777 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 137 predicate places.
[2022-01-19 11:21:08,777 INFO  L470      AbstractCegarLoop]: Abstraction has has 280 places, 283 transitions, 2157 flow
[2022-01-19 11:21:08,778 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 83.57142857142857) internal successors, (2925), 35 states have internal predecessors, (2925), 0 states have call successors, (0), 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-01-19 11:21:08,778 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:21:08,778 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:21:08,778 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-01-19 11:21:08,778 INFO  L402      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:21:08,779 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:21:08,779 INFO  L85        PathProgramCache]: Analyzing trace with hash 841785986, now seen corresponding path program 3 times
[2022-01-19 11:21:08,779 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:21:08,779 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518146888]
[2022-01-19 11:21:08,779 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:21:08,779 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:21:08,823 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:21:09,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:21:09,137 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:21:09,137 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518146888]
[2022-01-19 11:21:09,137 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518146888] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:21:09,137 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:21:09,137 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2022-01-19 11:21:09,137 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166062331]
[2022-01-19 11:21:09,137 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:21:09,138 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2022-01-19 11:21:09,138 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:21:09,138 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2022-01-19 11:21:09,139 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272
[2022-01-19 11:21:09,140 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 151
[2022-01-19 11:21:09,141 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 283 transitions, 2157 flow. Second operand  has 17 states, 17 states have (on average 113.94117647058823) internal successors, (1937), 17 states have internal predecessors, (1937), 0 states have call successors, (0), 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-01-19 11:21:09,141 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:21:09,141 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 151
[2022-01-19 11:21:09,141 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:21:10,871 INFO  L129       PetriNetUnfolder]: 2626/9424 cut-off events.
[2022-01-19 11:21:10,871 INFO  L130       PetriNetUnfolder]: For 26926/27590 co-relation queries the response was YES.
[2022-01-19 11:21:10,941 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 29483 conditions, 9424 events. 2626/9424 cut-off events. For 26926/27590 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 114902 event pairs, 309 based on Foata normal form. 60/9113 useless extension candidates. Maximal degree in co-relation 29317. Up to 1263 conditions per place. 
[2022-01-19 11:21:10,964 INFO  L132   encePairwiseOnDemand]: 135/151 looper letters, 131 selfloop transitions, 39 changer transitions 25/330 dead transitions.
[2022-01-19 11:21:10,964 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 330 transitions, 3122 flow
[2022-01-19 11:21:10,965 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2022-01-19 11:21:10,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2022-01-19 11:21:10,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1982 transitions.
[2022-01-19 11:21:10,971 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7721075185040904
[2022-01-19 11:21:10,971 INFO  L72            ComplementDD]: Start complementDD. Operand 17 states and 1982 transitions.
[2022-01-19 11:21:10,971 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 17 states and 1982 transitions.
[2022-01-19 11:21:10,973 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:21:10,973 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1982 transitions.
[2022-01-19 11:21:10,975 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 18 states, 17 states have (on average 116.58823529411765) internal successors, (1982), 17 states have internal predecessors, (1982), 0 states have call successors, (0), 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-01-19 11:21:10,977 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 18 states, 18 states have (on average 151.0) internal successors, (2718), 18 states have internal predecessors, (2718), 0 states have call successors, (0), 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-01-19 11:21:10,977 INFO  L81            ComplementDD]: Finished complementDD. Result  has 18 states, 18 states have (on average 151.0) internal successors, (2718), 18 states have internal predecessors, (2718), 0 states have call successors, (0), 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-01-19 11:21:10,977 INFO  L186             Difference]: Start difference. First operand has 280 places, 283 transitions, 2157 flow. Second operand 17 states and 1982 transitions.
[2022-01-19 11:21:10,977 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 330 transitions, 3122 flow
[2022-01-19 11:21:11,243 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 330 transitions, 2836 flow, removed 109 selfloop flow, removed 34 redundant places.
[2022-01-19 11:21:11,247 INFO  L242             Difference]: Finished difference. Result has 258 places, 291 transitions, 2230 flow
[2022-01-19 11:21:11,247 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2230, PETRI_PLACES=258, PETRI_TRANSITIONS=291}
[2022-01-19 11:21:11,247 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 115 predicate places.
[2022-01-19 11:21:11,247 INFO  L470      AbstractCegarLoop]: Abstraction has has 258 places, 291 transitions, 2230 flow
[2022-01-19 11:21:11,248 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 113.94117647058823) internal successors, (1937), 17 states have internal predecessors, (1937), 0 states have call successors, (0), 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-01-19 11:21:11,248 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:21:11,248 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:21:11,248 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-01-19 11:21:11,248 INFO  L402      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:21:11,248 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:21:11,248 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063335082, now seen corresponding path program 4 times
[2022-01-19 11:21:11,249 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:21:11,249 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317585894]
[2022-01-19 11:21:11,249 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:21:11,249 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:21:11,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:21:12,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:21:12,048 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:21:12,048 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317585894]
[2022-01-19 11:21:12,048 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317585894] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:21:12,048 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:21:12,048 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25
[2022-01-19 11:21:12,048 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391560777]
[2022-01-19 11:21:12,048 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:21:12,049 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2022-01-19 11:21:12,049 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:21:12,049 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2022-01-19 11:21:12,049 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600
[2022-01-19 11:21:12,050 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 151
[2022-01-19 11:21:12,052 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 291 transitions, 2230 flow. Second operand  has 25 states, 25 states have (on average 94.76) internal successors, (2369), 25 states have internal predecessors, (2369), 0 states have call successors, (0), 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-01-19 11:21:12,052 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:21:12,052 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 151
[2022-01-19 11:21:12,052 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:21:14,202 INFO  L129       PetriNetUnfolder]: 2854/10102 cut-off events.
[2022-01-19 11:21:14,202 INFO  L130       PetriNetUnfolder]: For 25773/26118 co-relation queries the response was YES.
[2022-01-19 11:21:14,254 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 31274 conditions, 10102 events. 2854/10102 cut-off events. For 25773/26118 co-relation queries the response was YES. Maximal size of possible extension queue 930. Compared 124516 event pairs, 372 based on Foata normal form. 42/9748 useless extension candidates. Maximal degree in co-relation 31112. Up to 1371 conditions per place. 
[2022-01-19 11:21:14,275 INFO  L132   encePairwiseOnDemand]: 128/151 looper letters, 105 selfloop transitions, 93 changer transitions 26/344 dead transitions.
[2022-01-19 11:21:14,275 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 344 transitions, 3338 flow
[2022-01-19 11:21:14,275 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. 
[2022-01-19 11:21:14,275 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2022-01-19 11:21:14,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3092 transitions.
[2022-01-19 11:21:14,279 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.6399006622516556
[2022-01-19 11:21:14,279 INFO  L72            ComplementDD]: Start complementDD. Operand 32 states and 3092 transitions.
[2022-01-19 11:21:14,279 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 32 states and 3092 transitions.
[2022-01-19 11:21:14,281 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:21:14,281 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 3092 transitions.
[2022-01-19 11:21:14,284 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 33 states, 32 states have (on average 96.625) internal successors, (3092), 32 states have internal predecessors, (3092), 0 states have call successors, (0), 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-01-19 11:21:14,290 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 33 states, 33 states have (on average 151.0) internal successors, (4983), 33 states have internal predecessors, (4983), 0 states have call successors, (0), 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-01-19 11:21:14,291 INFO  L81            ComplementDD]: Finished complementDD. Result  has 33 states, 33 states have (on average 151.0) internal successors, (4983), 33 states have internal predecessors, (4983), 0 states have call successors, (0), 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-01-19 11:21:14,291 INFO  L186             Difference]: Start difference. First operand has 258 places, 291 transitions, 2230 flow. Second operand 32 states and 3092 transitions.
[2022-01-19 11:21:14,291 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 344 transitions, 3338 flow
[2022-01-19 11:21:14,594 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 344 transitions, 3173 flow, removed 74 selfloop flow, removed 14 redundant places.
[2022-01-19 11:21:14,598 INFO  L242             Difference]: Finished difference. Result has 281 places, 300 transitions, 2622 flow
[2022-01-19 11:21:14,598 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2622, PETRI_PLACES=281, PETRI_TRANSITIONS=300}
[2022-01-19 11:21:14,598 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 138 predicate places.
[2022-01-19 11:21:14,598 INFO  L470      AbstractCegarLoop]: Abstraction has has 281 places, 300 transitions, 2622 flow
[2022-01-19 11:21:14,599 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 94.76) internal successors, (2369), 25 states have internal predecessors, (2369), 0 states have call successors, (0), 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-01-19 11:21:14,599 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:21:14,599 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:21:14,599 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-01-19 11:21:14,599 INFO  L402      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:21:14,600 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:21:14,600 INFO  L85        PathProgramCache]: Analyzing trace with hash 1205145827, now seen corresponding path program 1 times
[2022-01-19 11:21:14,600 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:21:14,600 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081950034]
[2022-01-19 11:21:14,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:21:14,600 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:21:14,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:21:14,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:21:14,733 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:21:14,733 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081950034]
[2022-01-19 11:21:14,734 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081950034] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:21:14,734 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:21:14,734 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-01-19 11:21:14,735 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054345251]
[2022-01-19 11:21:14,735 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:21:14,735 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-01-19 11:21:14,735 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:21:14,736 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-01-19 11:21:14,736 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2022-01-19 11:21:14,736 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 151
[2022-01-19 11:21:14,737 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 300 transitions, 2622 flow. Second operand  has 9 states, 9 states have (on average 127.22222222222223) internal successors, (1145), 9 states have internal predecessors, (1145), 0 states have call successors, (0), 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-01-19 11:21:14,737 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:21:14,737 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 151
[2022-01-19 11:21:14,737 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:21:17,565 INFO  L129       PetriNetUnfolder]: 7473/16796 cut-off events.
[2022-01-19 11:21:17,566 INFO  L130       PetriNetUnfolder]: For 96905/99430 co-relation queries the response was YES.
[2022-01-19 11:21:17,683 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 74277 conditions, 16796 events. 7473/16796 cut-off events. For 96905/99430 co-relation queries the response was YES. Maximal size of possible extension queue 1335. Compared 178446 event pairs, 376 based on Foata normal form. 803/16968 useless extension candidates. Maximal degree in co-relation 74201. Up to 3601 conditions per place. 
[2022-01-19 11:21:17,708 INFO  L132   encePairwiseOnDemand]: 141/151 looper letters, 246 selfloop transitions, 31 changer transitions 182/636 dead transitions.
[2022-01-19 11:21:17,708 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 636 transitions, 7928 flow
[2022-01-19 11:21:17,708 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-01-19 11:21:17,708 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2022-01-19 11:21:17,709 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1849 transitions.
[2022-01-19 11:21:17,712 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8746452223273415
[2022-01-19 11:21:17,712 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1849 transitions.
[2022-01-19 11:21:17,712 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1849 transitions.
[2022-01-19 11:21:17,712 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:21:17,716 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1849 transitions.
[2022-01-19 11:21:17,718 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 132.07142857142858) internal successors, (1849), 14 states have internal predecessors, (1849), 0 states have call successors, (0), 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-01-19 11:21:17,720 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 151.0) internal successors, (2265), 15 states have internal predecessors, (2265), 0 states have call successors, (0), 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-01-19 11:21:17,721 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 151.0) internal successors, (2265), 15 states have internal predecessors, (2265), 0 states have call successors, (0), 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-01-19 11:21:17,721 INFO  L186             Difference]: Start difference. First operand has 281 places, 300 transitions, 2622 flow. Second operand 14 states and 1849 transitions.
[2022-01-19 11:21:17,721 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 636 transitions, 7928 flow
[2022-01-19 11:21:18,329 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 636 transitions, 7344 flow, removed 220 selfloop flow, removed 33 redundant places.
[2022-01-19 11:21:18,334 INFO  L242             Difference]: Finished difference. Result has 258 places, 296 transitions, 2427 flow
[2022-01-19 11:21:18,335 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=2382, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2427, PETRI_PLACES=258, PETRI_TRANSITIONS=296}
[2022-01-19 11:21:18,335 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 115 predicate places.
[2022-01-19 11:21:18,337 INFO  L470      AbstractCegarLoop]: Abstraction has has 258 places, 296 transitions, 2427 flow
[2022-01-19 11:21:18,337 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 127.22222222222223) internal successors, (1145), 9 states have internal predecessors, (1145), 0 states have call successors, (0), 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-01-19 11:21:18,337 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:21:18,337 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:21:18,337 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-01-19 11:21:18,337 INFO  L402      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:21:18,338 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:21:18,338 INFO  L85        PathProgramCache]: Analyzing trace with hash 1611621748, now seen corresponding path program 1 times
[2022-01-19 11:21:18,338 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:21:18,338 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237454993]
[2022-01-19 11:21:18,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:21:18,338 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:21:18,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:21:19,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:21:19,150 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:21:19,150 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237454993]
[2022-01-19 11:21:19,150 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237454993] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:21:19,150 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:21:19,150 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-01-19 11:21:19,150 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437367404]
[2022-01-19 11:21:19,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:21:19,151 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-01-19 11:21:19,151 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:21:19,151 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-01-19 11:21:19,151 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702
[2022-01-19 11:21:19,152 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 151
[2022-01-19 11:21:19,153 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 296 transitions, 2427 flow. Second operand  has 27 states, 27 states have (on average 97.62962962962963) internal successors, (2636), 27 states have internal predecessors, (2636), 0 states have call successors, (0), 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-01-19 11:21:19,154 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:21:19,154 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 151
[2022-01-19 11:21:19,154 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:21:23,069 INFO  L129       PetriNetUnfolder]: 5743/21720 cut-off events.
[2022-01-19 11:21:23,069 INFO  L130       PetriNetUnfolder]: For 63956/66237 co-relation queries the response was YES.
[2022-01-19 11:21:23,323 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 72115 conditions, 21720 events. 5743/21720 cut-off events. For 63956/66237 co-relation queries the response was YES. Maximal size of possible extension queue 2239. Compared 321608 event pairs, 372 based on Foata normal form. 84/20810 useless extension candidates. Maximal degree in co-relation 71966. Up to 3190 conditions per place. 
[2022-01-19 11:21:23,347 INFO  L132   encePairwiseOnDemand]: 129/151 looper letters, 130 selfloop transitions, 69 changer transitions 93/414 dead transitions.
[2022-01-19 11:21:23,347 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 414 transitions, 4127 flow
[2022-01-19 11:21:23,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2022-01-19 11:21:23,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2022-01-19 11:21:23,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2991 transitions.
[2022-01-19 11:21:23,349 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.6602649006622516
[2022-01-19 11:21:23,350 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 2991 transitions.
[2022-01-19 11:21:23,350 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 2991 transitions.
[2022-01-19 11:21:23,350 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:21:23,351 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2991 transitions.
[2022-01-19 11:21:23,353 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 99.7) internal successors, (2991), 30 states have internal predecessors, (2991), 0 states have call successors, (0), 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-01-19 11:21:23,356 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 151.0) internal successors, (4681), 31 states have internal predecessors, (4681), 0 states have call successors, (0), 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-01-19 11:21:23,356 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 151.0) internal successors, (4681), 31 states have internal predecessors, (4681), 0 states have call successors, (0), 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-01-19 11:21:23,356 INFO  L186             Difference]: Start difference. First operand has 258 places, 296 transitions, 2427 flow. Second operand 30 states and 2991 transitions.
[2022-01-19 11:21:23,356 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 414 transitions, 4127 flow
[2022-01-19 11:21:26,422 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 414 transitions, 3972 flow, removed 48 selfloop flow, removed 16 redundant places.
[2022-01-19 11:21:26,426 INFO  L242             Difference]: Finished difference. Result has 284 places, 297 transitions, 2582 flow
[2022-01-19 11:21:26,427 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=2306, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2582, PETRI_PLACES=284, PETRI_TRANSITIONS=297}
[2022-01-19 11:21:26,427 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 141 predicate places.
[2022-01-19 11:21:26,427 INFO  L470      AbstractCegarLoop]: Abstraction has has 284 places, 297 transitions, 2582 flow
[2022-01-19 11:21:26,427 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 97.62962962962963) internal successors, (2636), 27 states have internal predecessors, (2636), 0 states have call successors, (0), 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-01-19 11:21:26,427 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:21:26,427 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:21:26,427 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-01-19 11:21:26,428 INFO  L402      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:21:26,428 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:21:26,428 INFO  L85        PathProgramCache]: Analyzing trace with hash 879687732, now seen corresponding path program 2 times
[2022-01-19 11:21:26,428 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:21:26,428 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90982313]
[2022-01-19 11:21:26,428 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:21:26,428 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:21:26,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:21:27,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:21:27,640 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:21:27,640 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90982313]
[2022-01-19 11:21:27,640 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90982313] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:21:27,640 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:21:27,640 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29
[2022-01-19 11:21:27,640 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483908260]
[2022-01-19 11:21:27,640 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:21:27,641 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2022-01-19 11:21:27,641 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:21:27,641 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2022-01-19 11:21:27,641 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812
[2022-01-19 11:21:27,642 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 151
[2022-01-19 11:21:27,643 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 297 transitions, 2582 flow. Second operand  has 29 states, 29 states have (on average 92.6896551724138) internal successors, (2688), 29 states have internal predecessors, (2688), 0 states have call successors, (0), 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-01-19 11:21:27,643 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:21:27,643 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 151
[2022-01-19 11:21:27,643 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:21:31,976 INFO  L129       PetriNetUnfolder]: 5599/21065 cut-off events.
[2022-01-19 11:21:31,977 INFO  L130       PetriNetUnfolder]: For 41511/42479 co-relation queries the response was YES.
[2022-01-19 11:21:32,099 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 58288 conditions, 21065 events. 5599/21065 cut-off events. For 41511/42479 co-relation queries the response was YES. Maximal size of possible extension queue 2146. Compared 311342 event pairs, 339 based on Foata normal form. 97/20187 useless extension candidates. Maximal degree in co-relation 58215. Up to 2488 conditions per place. 
[2022-01-19 11:21:32,114 INFO  L132   encePairwiseOnDemand]: 127/151 looper letters, 82 selfloop transitions, 62 changer transitions 97/356 dead transitions.
[2022-01-19 11:21:32,114 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 356 transitions, 3694 flow
[2022-01-19 11:21:32,114 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2022-01-19 11:21:32,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2022-01-19 11:21:32,117 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2918 transitions.
[2022-01-19 11:21:32,118 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.6233710745567187
[2022-01-19 11:21:32,118 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2918 transitions.
[2022-01-19 11:21:32,118 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2918 transitions.
[2022-01-19 11:21:32,118 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:21:32,118 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2918 transitions.
[2022-01-19 11:21:32,130 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 32 states, 31 states have (on average 94.12903225806451) internal successors, (2918), 31 states have internal predecessors, (2918), 0 states have call successors, (0), 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-01-19 11:21:32,133 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 32 states, 32 states have (on average 151.0) internal successors, (4832), 32 states have internal predecessors, (4832), 0 states have call successors, (0), 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-01-19 11:21:32,134 INFO  L81            ComplementDD]: Finished complementDD. Result  has 32 states, 32 states have (on average 151.0) internal successors, (4832), 32 states have internal predecessors, (4832), 0 states have call successors, (0), 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-01-19 11:21:32,134 INFO  L186             Difference]: Start difference. First operand has 284 places, 297 transitions, 2582 flow. Second operand 31 states and 2918 transitions.
[2022-01-19 11:21:32,134 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 356 transitions, 3694 flow
[2022-01-19 11:21:34,112 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 356 transitions, 3491 flow, removed 55 selfloop flow, removed 32 redundant places.
[2022-01-19 11:21:34,115 INFO  L242             Difference]: Finished difference. Result has 278 places, 255 transitions, 2080 flow
[2022-01-19 11:21:34,116 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=2440, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2080, PETRI_PLACES=278, PETRI_TRANSITIONS=255}
[2022-01-19 11:21:34,116 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 135 predicate places.
[2022-01-19 11:21:34,116 INFO  L470      AbstractCegarLoop]: Abstraction has has 278 places, 255 transitions, 2080 flow
[2022-01-19 11:21:34,117 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 92.6896551724138) internal successors, (2688), 29 states have internal predecessors, (2688), 0 states have call successors, (0), 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-01-19 11:21:34,117 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:21:34,117 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:21:34,117 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-01-19 11:21:34,117 INFO  L402      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:21:34,118 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:21:34,118 INFO  L85        PathProgramCache]: Analyzing trace with hash -216848264, now seen corresponding path program 3 times
[2022-01-19 11:21:34,118 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:21:34,118 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564828028]
[2022-01-19 11:21:34,118 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:21:34,118 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:21:34,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:21:35,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:21:35,063 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:21:35,063 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564828028]
[2022-01-19 11:21:35,063 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564828028] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:21:35,063 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:21:35,063 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27
[2022-01-19 11:21:35,063 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596832989]
[2022-01-19 11:21:35,063 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:21:35,064 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2022-01-19 11:21:35,064 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:21:35,064 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2022-01-19 11:21:35,064 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702
[2022-01-19 11:21:35,065 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 151
[2022-01-19 11:21:35,066 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 255 transitions, 2080 flow. Second operand  has 27 states, 27 states have (on average 93.74074074074075) internal successors, (2531), 27 states have internal predecessors, (2531), 0 states have call successors, (0), 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-01-19 11:21:35,066 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:21:35,066 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 151
[2022-01-19 11:21:35,066 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:21:38,274 INFO  L129       PetriNetUnfolder]: 4775/18101 cut-off events.
[2022-01-19 11:21:38,274 INFO  L130       PetriNetUnfolder]: For 31122/31745 co-relation queries the response was YES.
[2022-01-19 11:21:38,486 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 46682 conditions, 18101 events. 4775/18101 cut-off events. For 31122/31745 co-relation queries the response was YES. Maximal size of possible extension queue 1921. Compared 264165 event pairs, 294 based on Foata normal form. 68/17482 useless extension candidates. Maximal degree in co-relation 46635. Up to 2516 conditions per place. 
[2022-01-19 11:21:38,505 INFO  L132   encePairwiseOnDemand]: 125/151 looper letters, 119 selfloop transitions, 100 changer transitions 27/363 dead transitions.
[2022-01-19 11:21:38,505 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 363 transitions, 3801 flow
[2022-01-19 11:21:38,506 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2022-01-19 11:21:38,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2022-01-19 11:21:38,508 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3157 transitions.
[2022-01-19 11:21:38,509 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.6335540838852097
[2022-01-19 11:21:38,509 INFO  L72            ComplementDD]: Start complementDD. Operand 33 states and 3157 transitions.
[2022-01-19 11:21:38,509 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 33 states and 3157 transitions.
[2022-01-19 11:21:38,509 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:21:38,509 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3157 transitions.
[2022-01-19 11:21:38,512 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 34 states, 33 states have (on average 95.66666666666667) internal successors, (3157), 33 states have internal predecessors, (3157), 0 states have call successors, (0), 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-01-19 11:21:38,515 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 34 states, 34 states have (on average 151.0) internal successors, (5134), 34 states have internal predecessors, (5134), 0 states have call successors, (0), 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-01-19 11:21:38,515 INFO  L81            ComplementDD]: Finished complementDD. Result  has 34 states, 34 states have (on average 151.0) internal successors, (5134), 34 states have internal predecessors, (5134), 0 states have call successors, (0), 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-01-19 11:21:38,515 INFO  L186             Difference]: Start difference. First operand has 278 places, 255 transitions, 2080 flow. Second operand 33 states and 3157 transitions.
[2022-01-19 11:21:38,515 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 363 transitions, 3801 flow
[2022-01-19 11:21:39,778 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 363 transitions, 3448 flow, removed 78 selfloop flow, removed 36 redundant places.
[2022-01-19 11:21:39,781 INFO  L242             Difference]: Finished difference. Result has 273 places, 300 transitions, 2748 flow
[2022-01-19 11:21:39,782 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2748, PETRI_PLACES=273, PETRI_TRANSITIONS=300}
[2022-01-19 11:21:39,782 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 130 predicate places.
[2022-01-19 11:21:39,782 INFO  L470      AbstractCegarLoop]: Abstraction has has 273 places, 300 transitions, 2748 flow
[2022-01-19 11:21:39,782 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 93.74074074074075) internal successors, (2531), 27 states have internal predecessors, (2531), 0 states have call successors, (0), 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-01-19 11:21:39,782 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:21:39,782 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:21:39,782 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2022-01-19 11:21:39,782 INFO  L402      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:21:39,783 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:21:39,783 INFO  L85        PathProgramCache]: Analyzing trace with hash 1859758930, now seen corresponding path program 4 times
[2022-01-19 11:21:39,783 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:21:39,783 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572108850]
[2022-01-19 11:21:39,783 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:21:39,783 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:21:39,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:21:40,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:21:40,655 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:21:40,655 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572108850]
[2022-01-19 11:21:40,655 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572108850] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:21:40,655 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:21:40,655 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28
[2022-01-19 11:21:40,655 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335487200]
[2022-01-19 11:21:40,655 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:21:40,656 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2022-01-19 11:21:40,656 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:21:40,656 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2022-01-19 11:21:40,656 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756
[2022-01-19 11:21:40,657 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 151
[2022-01-19 11:21:40,658 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 300 transitions, 2748 flow. Second operand  has 28 states, 28 states have (on average 93.67857142857143) internal successors, (2623), 28 states have internal predecessors, (2623), 0 states have call successors, (0), 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-01-19 11:21:40,658 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:21:40,658 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 151
[2022-01-19 11:21:40,659 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:21:43,315 INFO  L129       PetriNetUnfolder]: 4198/16021 cut-off events.
[2022-01-19 11:21:43,316 INFO  L130       PetriNetUnfolder]: For 26623/27089 co-relation queries the response was YES.
[2022-01-19 11:21:43,488 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 41268 conditions, 16021 events. 4198/16021 cut-off events. For 26623/27089 co-relation queries the response was YES. Maximal size of possible extension queue 1710. Compared 229541 event pairs, 292 based on Foata normal form. 41/15441 useless extension candidates. Maximal degree in co-relation 41226. Up to 2213 conditions per place. 
[2022-01-19 11:21:43,503 INFO  L132   encePairwiseOnDemand]: 126/151 looper letters, 107 selfloop transitions, 113 changer transitions 16/353 dead transitions.
[2022-01-19 11:21:43,504 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 353 transitions, 3694 flow
[2022-01-19 11:21:43,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2022-01-19 11:21:43,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2022-01-19 11:21:43,505 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3153 transitions.
[2022-01-19 11:21:43,506 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.6327513546056592
[2022-01-19 11:21:43,506 INFO  L72            ComplementDD]: Start complementDD. Operand 33 states and 3153 transitions.
[2022-01-19 11:21:43,506 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 33 states and 3153 transitions.
[2022-01-19 11:21:43,506 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:21:43,506 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3153 transitions.
[2022-01-19 11:21:43,509 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 34 states, 33 states have (on average 95.54545454545455) internal successors, (3153), 33 states have internal predecessors, (3153), 0 states have call successors, (0), 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-01-19 11:21:43,531 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 34 states, 34 states have (on average 151.0) internal successors, (5134), 34 states have internal predecessors, (5134), 0 states have call successors, (0), 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-01-19 11:21:43,532 INFO  L81            ComplementDD]: Finished complementDD. Result  has 34 states, 34 states have (on average 151.0) internal successors, (5134), 34 states have internal predecessors, (5134), 0 states have call successors, (0), 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-01-19 11:21:43,532 INFO  L186             Difference]: Start difference. First operand has 273 places, 300 transitions, 2748 flow. Second operand 33 states and 3153 transitions.
[2022-01-19 11:21:43,532 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 353 transitions, 3694 flow
[2022-01-19 11:21:44,476 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 353 transitions, 3563 flow, removed 39 selfloop flow, removed 22 redundant places.
[2022-01-19 11:21:44,480 INFO  L242             Difference]: Finished difference. Result has 285 places, 303 transitions, 2935 flow
[2022-01-19 11:21:44,480 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=2639, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2935, PETRI_PLACES=285, PETRI_TRANSITIONS=303}
[2022-01-19 11:21:44,481 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 142 predicate places.
[2022-01-19 11:21:44,481 INFO  L470      AbstractCegarLoop]: Abstraction has has 285 places, 303 transitions, 2935 flow
[2022-01-19 11:21:44,481 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 93.67857142857143) internal successors, (2623), 28 states have internal predecessors, (2623), 0 states have call successors, (0), 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-01-19 11:21:44,481 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:21:44,481 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:21:44,481 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2022-01-19 11:21:44,481 INFO  L402      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:21:44,482 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:21:44,482 INFO  L85        PathProgramCache]: Analyzing trace with hash 1350834006, now seen corresponding path program 5 times
[2022-01-19 11:21:44,482 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:21:44,482 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714632898]
[2022-01-19 11:21:44,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:21:44,482 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:21:44,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 11:21:45,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 11:21:45,681 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 11:21:45,681 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714632898]
[2022-01-19 11:21:45,681 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714632898] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 11:21:45,681 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 11:21:45,681 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29
[2022-01-19 11:21:45,681 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973200799]
[2022-01-19 11:21:45,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 11:21:45,681 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2022-01-19 11:21:45,682 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 11:21:45,683 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2022-01-19 11:21:45,684 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812
[2022-01-19 11:21:45,685 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 151
[2022-01-19 11:21:45,686 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 303 transitions, 2935 flow. Second operand  has 29 states, 29 states have (on average 92.65517241379311) internal successors, (2687), 29 states have internal predecessors, (2687), 0 states have call successors, (0), 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-01-19 11:21:45,686 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 11:21:45,686 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 151
[2022-01-19 11:21:45,686 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 11:21:48,720 INFO  L129       PetriNetUnfolder]: 3925/15058 cut-off events.
[2022-01-19 11:21:48,720 INFO  L130       PetriNetUnfolder]: For 27335/27798 co-relation queries the response was YES.
[2022-01-19 11:21:48,804 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 39068 conditions, 15058 events. 3925/15058 cut-off events. For 27335/27798 co-relation queries the response was YES. Maximal size of possible extension queue 1608. Compared 213888 event pairs, 265 based on Foata normal form. 25/14504 useless extension candidates. Maximal degree in co-relation 39024. Up to 2039 conditions per place. 
[2022-01-19 11:21:48,821 INFO  L132   encePairwiseOnDemand]: 126/151 looper letters, 105 selfloop transitions, 77 changer transitions 47/345 dead transitions.
[2022-01-19 11:21:48,821 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 345 transitions, 3723 flow
[2022-01-19 11:21:48,821 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2022-01-19 11:21:48,821 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2022-01-19 11:21:48,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3112 transitions.
[2022-01-19 11:21:48,824 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.6245233794902669
[2022-01-19 11:21:48,824 INFO  L72            ComplementDD]: Start complementDD. Operand 33 states and 3112 transitions.
[2022-01-19 11:21:48,824 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 33 states and 3112 transitions.
[2022-01-19 11:21:48,825 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 11:21:48,825 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3112 transitions.
[2022-01-19 11:21:48,827 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 34 states, 33 states have (on average 94.3030303030303) internal successors, (3112), 33 states have internal predecessors, (3112), 0 states have call successors, (0), 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-01-19 11:21:48,830 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 34 states, 34 states have (on average 151.0) internal successors, (5134), 34 states have internal predecessors, (5134), 0 states have call successors, (0), 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-01-19 11:21:48,831 INFO  L81            ComplementDD]: Finished complementDD. Result  has 34 states, 34 states have (on average 151.0) internal successors, (5134), 34 states have internal predecessors, (5134), 0 states have call successors, (0), 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-01-19 11:21:48,831 INFO  L186             Difference]: Start difference. First operand has 285 places, 303 transitions, 2935 flow. Second operand 33 states and 3112 transitions.
[2022-01-19 11:21:48,831 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 345 transitions, 3723 flow
[2022-01-19 11:21:49,817 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 345 transitions, 3561 flow, removed 38 selfloop flow, removed 23 redundant places.
[2022-01-19 11:21:49,822 INFO  L242             Difference]: Finished difference. Result has 295 places, 280 transitions, 2593 flow
[2022-01-19 11:21:49,822 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=2785, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2593, PETRI_PLACES=295, PETRI_TRANSITIONS=280}
[2022-01-19 11:21:49,822 INFO  L334   CegarLoopForPetriNet]: 143 programPoint places, 152 predicate places.
[2022-01-19 11:21:49,822 INFO  L470      AbstractCegarLoop]: Abstraction has has 295 places, 280 transitions, 2593 flow
[2022-01-19 11:21:49,823 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 92.65517241379311) internal successors, (2687), 29 states have internal predecessors, (2687), 0 states have call successors, (0), 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-01-19 11:21:49,824 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 11:21:49,824 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:21:49,824 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2022-01-19 11:21:49,824 INFO  L402      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] ===
[2022-01-19 11:21:49,824 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 11:21:49,824 INFO  L85        PathProgramCache]: Analyzing trace with hash 1023962092, now seen corresponding path program 6 times
[2022-01-19 11:21:49,824 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 11:21:49,824 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051533358]
[2022-01-19 11:21:49,824 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 11:21:49,824 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 11:21:49,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-01-19 11:21:49,876 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-01-19 11:21:49,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-01-19 11:21:49,973 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-01-19 11:21:49,973 INFO  L628         BasicCegarLoop]: Counterexample is feasible
[2022-01-19 11:21:49,973 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2022-01-19 11:21:49,974 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining)
[2022-01-19 11:21:49,975 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining)
[2022-01-19 11:21:49,976 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining)
[2022-01-19 11:21:49,977 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining)
[2022-01-19 11:21:49,977 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2022-01-19 11:21:49,980 INFO  L732         BasicCegarLoop]: Path program histogram: [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 11:21:49,983 INFO  L230   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-01-19 11:21:49,983 INFO  L180   ceAbstractionStarter]: Computing trace abstraction results
[2022-01-19 11:21:50,150 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 11:21:50 BasicIcfg
[2022-01-19 11:21:50,150 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-01-19 11:21:50,151 INFO  L158              Benchmark]: Toolchain (without parser) took 67048.60ms. Allocated memory was 388.0MB in the beginning and 7.5GB in the end (delta: 7.2GB). Free memory was 332.8MB in the beginning and 5.9GB in the end (delta: -5.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB.
[2022-01-19 11:21:50,151 INFO  L158              Benchmark]: CDTParser took 0.08ms. Allocated memory is still 388.0MB. Free memory is still 350.7MB. There was no memory consumed. Max. memory is 16.0GB.
[2022-01-19 11:21:50,151 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 328.49ms. Allocated memory was 388.0MB in the beginning and 482.3MB in the end (delta: 94.4MB). Free memory was 332.6MB in the beginning and 441.8MB in the end (delta: -109.2MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB.
[2022-01-19 11:21:50,152 INFO  L158              Benchmark]: Boogie Procedure Inliner took 31.57ms. Allocated memory is still 482.3MB. Free memory was 441.8MB in the beginning and 439.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB.
[2022-01-19 11:21:50,152 INFO  L158              Benchmark]: Boogie Preprocessor took 26.48ms. Allocated memory is still 482.3MB. Free memory was 439.6MB in the beginning and 436.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB.
[2022-01-19 11:21:50,152 INFO  L158              Benchmark]: RCFGBuilder took 1065.29ms. Allocated memory is still 482.3MB. Free memory was 436.6MB in the beginning and 309.7MB in the end (delta: 126.9MB). Peak memory consumption was 127.9MB. Max. memory is 16.0GB.
[2022-01-19 11:21:50,152 INFO  L158              Benchmark]: TraceAbstraction took 65581.63ms. Allocated memory was 482.3MB in the beginning and 7.5GB in the end (delta: 7.1GB). Free memory was 309.7MB in the beginning and 5.9GB in the end (delta: -5.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB.
[2022-01-19 11:21:50,153 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.08ms. Allocated memory is still 388.0MB. Free memory is still 350.7MB. There was no memory consumed. Max. memory is 16.0GB.
 * CACSL2BoogieTranslator took 328.49ms. Allocated memory was 388.0MB in the beginning and 482.3MB in the end (delta: 94.4MB). Free memory was 332.6MB in the beginning and 441.8MB in the end (delta: -109.2MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB.
 * Boogie Procedure Inliner took 31.57ms. Allocated memory is still 482.3MB. Free memory was 441.8MB in the beginning and 439.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB.
 * Boogie Preprocessor took 26.48ms. Allocated memory is still 482.3MB. Free memory was 439.6MB in the beginning and 436.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB.
 * RCFGBuilder took 1065.29ms. Allocated memory is still 482.3MB. Free memory was 436.6MB in the beginning and 309.7MB in the end (delta: 126.9MB). Peak memory consumption was 127.9MB. Max. memory is 16.0GB.
 * TraceAbstraction took 65581.63ms. Allocated memory was 482.3MB in the beginning and 7.5GB in the end (delta: 7.1GB). Free memory was 309.7MB in the beginning and 5.9GB in the end (delta: -5.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L711]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L713]               0  int __unbuffered_p0_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0]
[L715]               0  int __unbuffered_p0_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0]
[L717]               0  int __unbuffered_p2_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0]
[L718]               0  _Bool __unbuffered_p2_EAX$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0]
[L719]               0  int __unbuffered_p2_EAX$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0]
[L720]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0]
[L721]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0]
[L722]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0]
[L723]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0]
[L724]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd4;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0]
[L725]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0]
[L726]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0]
[L727]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0]
[L728]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0]
[L729]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd4;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0]
[L730]               0  _Bool __unbuffered_p2_EAX$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0]
[L731]               0  int *__unbuffered_p2_EAX$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}]
[L732]               0  int __unbuffered_p2_EAX$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0]
[L733]               0  _Bool __unbuffered_p2_EAX$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0]
[L734]               0  int __unbuffered_p2_EAX$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0]
[L735]               0  _Bool __unbuffered_p2_EAX$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0]
[L736]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0]
[L737]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L739]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}]
[L740]               0  _Bool x$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0]
[L741]               0  int x$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0]
[L742]               0  _Bool x$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L743]               0  _Bool x$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0]
[L744]               0  _Bool x$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0]
[L745]               0  _Bool x$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0]
[L746]               0  _Bool x$r_buff0_thd4;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0]
[L747]               0  _Bool x$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0]
[L748]               0  _Bool x$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0]
[L749]               0  _Bool x$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L750]               0  _Bool x$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0]
[L751]               0  _Bool x$r_buff1_thd4;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0]
[L752]               0  _Bool x$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0]
[L753]               0  int *x$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L754]               0  int x$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L755]               0  _Bool x$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L756]               0  int x$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L757]               0  _Bool x$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0]
[L759]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L760]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L761]               0  _Bool weak$$choice1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L762]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L871]               0  pthread_t t2245;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t2245={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L872]  FCALL, FORK  0  pthread_create(&t2245, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2245, ((void *)0), P0, ((void *)0))=-2, t2245={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L873]               0  pthread_t t2246;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2245={5:0}, t2246={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L874]  FCALL, FORK  0  pthread_create(&t2246, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2246, ((void *)0), P1, ((void *)0))=-1, t2245={5:0}, t2246={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L875]               0  pthread_t t2247;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2245={5:0}, t2246={7:0}, t2247={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L876]  FCALL, FORK  0  pthread_create(&t2247, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2247, ((void *)0), P2, ((void *)0))=0, t2245={5:0}, t2246={7:0}, t2247={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L811]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L812]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L813]               3  x$flush_delayed = weak$$choice2
[L814]  EXPR         3  \read(x)
[L814]               3  x$mem_tmp = x
[L815]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1)
[L815]  EXPR         3  \read(x)
[L815]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1)
[L815]               3  x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1)
[L816]  EXPR         3  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0))
[L816]               3  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0))
[L817]  EXPR         3  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))
[L817]               3  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))
[L818]  EXPR         3  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used))
[L818]               3  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used))
[L819]  EXPR         3  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L819]               3  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L820]  EXPR         3  weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3))
[L820]               3  x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3))
[L821]  EXPR         3  weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L821]               3  x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L822]               3  __unbuffered_p2_EAX$read_delayed = (_Bool)1
[L823]               3  __unbuffered_p2_EAX$read_delayed_var = &x
[L824]  EXPR         3  \read(x)
[L824]               3  __unbuffered_p2_EAX = x
[L825]  EXPR         3  x$flush_delayed ? x$mem_tmp : x
[L825]               3  x = x$flush_delayed ? x$mem_tmp : x
[L826]               3  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L829]               3  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L877]               0  pthread_t t2248;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2245={5:0}, t2246={7:0}, t2247={8:0}, t2248={9:0}, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L832]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L832]  EXPR         3  x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L832]  EXPR         3  \read(x)
[L832]  EXPR         3  x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L832]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L832]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L833]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L833]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L834]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L834]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L835]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L835]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L836]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L836]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L878]  FCALL, FORK  0  pthread_create(&t2248, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2248, ((void *)0), P3, ((void *)0))=1, t2245={5:0}, t2246={7:0}, t2247={8:0}, t2248={9:0}, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L846]               4  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L766]               1  __unbuffered_p0_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L769]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L770]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L771]               1  x$flush_delayed = weak$$choice2
[L772]  EXPR         1  \read(x)
[L772]               1  x$mem_tmp = x
[L773]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L773]  EXPR         1  \read(x)
[L773]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L773]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L774]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L774]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L775]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L775]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L776]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L776]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L777]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L777]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L778]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L778]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L779]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L779]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L780]  EXPR         1  \read(x)
[L780]               1  __unbuffered_p0_EBX = x
[L781]  EXPR         1  x$flush_delayed ? x$mem_tmp : x
[L781]               1  x = x$flush_delayed ? x$mem_tmp : x
[L782]               1  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L794]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L797]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L797]  EXPR         2  x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x
[L797]  EXPR         2  \read(x)
[L797]  EXPR         2  x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x
[L797]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L797]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L798]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L798]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L799]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L799]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L800]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L800]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L801]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L801]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L849]  EXPR         4  x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L849]  EXPR         4  x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x
[L849]  EXPR         4  \read(x)
[L849]  EXPR         4  x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x
[L849]  EXPR         4  x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L849]               4  x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L850]  EXPR         4  x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L850]               4  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L851]  EXPR         4  x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L851]               4  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L852]  EXPR         4  x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L852]               4  x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L853]  EXPR         4  x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
[L853]               4  x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
[L839]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L804]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L787]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L856]               4  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L880]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2245={5:0}, t2246={7:0}, t2247={8:0}, t2248={9:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L882]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L882]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L884]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L884]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L884]  EXPR         0  \read(x)
[L884]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L884]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L884]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L885]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L885]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L886]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L886]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L887]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L887]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L888]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L888]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L891]               0  weak$$choice1 = __VERIFIER_nondet_bool()
[L892]  EXPR         0  __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L892]  EXPR         0  weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX
[L892]  EXPR         0  \read(*__unbuffered_p2_EAX$read_delayed_var)
[L892]  EXPR         0  weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX
[L892]  EXPR         0  __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L892]               0  __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L893]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1)
        VAL             [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2245={5:0}, t2246={7:0}, t2247={8:0}, t2248={9:0}, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L895]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
        VAL             [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L19]                0  reach_error()
        VAL             [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]

  - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 9 procedures, 183 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 65.3s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 52.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1856 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1856 mSDsluCounter, 3173 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4163 mSDsCounter, 1181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9072 IncrementalHoareTripleChecker+Invalid, 10253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1181 mSolverCounterUnsat, 414 mSDtfsCounter, 9072 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 645 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 580 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5195 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2935occurred in iteration=20, InterpolantAutomatonStates: 465, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 2532 NumberOfCodeBlocks, 2532 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2390 ConstructedInterpolants, 0 QuantifiedInterpolants, 35266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2022-01-19 11:21:50,219 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...