/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -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-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i


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


This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m
[2023-11-17 11:25:05,875 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-11-17 11:25:05,941 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf
[2023-11-17 11:25:05,971 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-17 11:25:05,973 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-17 11:25:05,973 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-17 11:25:05,973 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-17 11:25:05,974 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-17 11:25:05,974 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-11-17 11:25:05,977 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-17 11:25:05,978 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-17 11:25:05,978 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-11-17 11:25:05,978 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-17 11:25:05,979 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-11-17 11:25:05,979 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-17 11:25:05,979 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-17 11:25:05,979 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-17 11:25:05,980 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-17 11:25:05,980 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-11-17 11:25:05,980 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-17 11:25:05,980 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-11-17 11:25:05,981 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-17 11:25:05,981 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-17 11:25:05,981 INFO  L153        SettingsManager]:  * To the following directory=./dump/
[2023-11-17 11:25:05,981 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-17 11:25:05,981 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-17 11:25:05,982 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-17 11:25:05,982 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-17 11:25:05,982 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-17 11:25:05,982 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-17 11:25:05,983 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-17 11:25:05,983 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-17 11:25:05,983 INFO  L153        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
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true
[2023-11-17 11:25:06,194 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-17 11:25:06,216 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-17 11:25:06,219 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-17 11:25:06,219 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-11-17 11:25:06,220 INFO  L274        PluginConnector]: CDTParser initialized
[2023-11-17 11:25:06,222 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-17 11:25:07,276 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-11-17 11:25:07,519 INFO  L384              CDTParser]: Found 1 translation units.
[2023-11-17 11:25:07,521 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-17 11:25:07,536 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3ad0dad/2b36fd4eae3147b5876813867b000e31/FLAGb737ebe8f
[2023-11-17 11:25:07,552 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3ad0dad/2b36fd4eae3147b5876813867b000e31
[2023-11-17 11:25:07,554 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-17 11:25:07,555 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-11-17 11:25:07,558 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-17 11:25:07,558 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-17 11:25:07,561 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-17 11:25:07,562 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:25:07" (1/1) ...
[2023-11-17 11:25:07,562 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@979c04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:07, skipping insertion in model container
[2023-11-17 11:25:07,562 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:25:07" (1/1) ...
[2023-11-17 11:25:07,612 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-11-17 11:25:07,726 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982]
[2023-11-17 11:25:07,886 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-17 11:25:07,903 INFO  L202         MainTranslator]: Completed pre-run
[2023-11-17 11:25:07,927 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982]
[2023-11-17 11:25:07,968 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-17 11:25:07,988 WARN  L675               CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-17 11:25:07,989 WARN  L675               CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-17 11:25:07,995 INFO  L206         MainTranslator]: Completed translation
[2023-11-17 11:25:07,996 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:07 WrapperNode
[2023-11-17 11:25:07,996 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-17 11:25:07,997 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-17 11:25:07,997 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-17 11:25:07,997 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-17 11:25:08,003 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:07" (1/1) ...
[2023-11-17 11:25:08,021 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:07" (1/1) ...
[2023-11-17 11:25:08,045 INFO  L138                Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144
[2023-11-17 11:25:08,045 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-17 11:25:08,046 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-17 11:25:08,046 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-17 11:25:08,046 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-11-17 11:25:08,066 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:07" (1/1) ...
[2023-11-17 11:25:08,066 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:07" (1/1) ...
[2023-11-17 11:25:08,069 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:07" (1/1) ...
[2023-11-17 11:25:08,069 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:07" (1/1) ...
[2023-11-17 11:25:08,075 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:07" (1/1) ...
[2023-11-17 11:25:08,076 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:07" (1/1) ...
[2023-11-17 11:25:08,078 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:07" (1/1) ...
[2023-11-17 11:25:08,079 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:07" (1/1) ...
[2023-11-17 11:25:08,084 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-17 11:25:08,085 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-17 11:25:08,085 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-11-17 11:25:08,085 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-11-17 11:25:08,086 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:07" (1/1) ...
[2023-11-17 11:25:08,090 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-17 11:25:08,120 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-17 11:25:08,138 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)
[2023-11-17 11:25:08,186 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
[2023-11-17 11:25:08,204 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-17 11:25:08,205 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-17 11:25:08,205 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-17 11:25:08,205 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-17 11:25:08,205 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-17 11:25:08,205 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2023-11-17 11:25:08,205 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2023-11-17 11:25:08,205 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2023-11-17 11:25:08,206 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2023-11-17 11:25:08,206 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2023-11-17 11:25:08,206 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2023-11-17 11:25:08,206 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2023-11-17 11:25:08,206 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2023-11-17 11:25:08,206 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-17 11:25:08,206 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-17 11:25:08,206 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-17 11:25:08,206 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-17 11:25:08,207 WARN  L211             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-17 11:25:08,339 INFO  L239             CfgBuilder]: Building ICFG
[2023-11-17 11:25:08,340 INFO  L265             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-17 11:25:08,629 INFO  L280             CfgBuilder]: Performing block encoding
[2023-11-17 11:25:08,808 INFO  L302             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-17 11:25:08,808 INFO  L307             CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-17 11:25:08,809 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:25:08 BoogieIcfgContainer
[2023-11-17 11:25:08,809 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-17 11:25:08,812 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-17 11:25:08,812 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-11-17 11:25:08,814 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-11-17 11:25:08,814 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:25:07" (1/3) ...
[2023-11-17 11:25:08,815 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319363cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:25:08, skipping insertion in model container
[2023-11-17 11:25:08,816 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:07" (2/3) ...
[2023-11-17 11:25:08,816 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319363cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:25:08, skipping insertion in model container
[2023-11-17 11:25:08,816 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:25:08" (3/3) ...
[2023-11-17 11:25:08,817 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-17 11:25:08,829 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-17 11:25:08,830 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2023-11-17 11:25:08,830 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-17 11:25:08,883 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-17 11:25:08,916 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 62 places, 51 transitions, 118 flow
[2023-11-17 11:25:08,947 INFO  L124   PetriNetUnfolderBase]: 2/47 cut-off events.
[2023-11-17 11:25:08,947 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-17 11:25:08,951 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 2/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. 
[2023-11-17 11:25:08,951 INFO  L82        GeneralOperation]: Start removeDead. Operand has 62 places, 51 transitions, 118 flow
[2023-11-17 11:25:08,956 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 58 places, 47 transitions, 106 flow
[2023-11-17 11:25:08,959 INFO  L115   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2023-11-17 11:25:08,978 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 47 transitions, 106 flow
[2023-11-17 11:25:08,982 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 47 transitions, 106 flow
[2023-11-17 11:25:08,982 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 58 places, 47 transitions, 106 flow
[2023-11-17 11:25:08,996 INFO  L124   PetriNetUnfolderBase]: 2/47 cut-off events.
[2023-11-17 11:25:08,996 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-17 11:25:08,997 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 2/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. 
[2023-11-17 11:25:08,998 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1378
[2023-11-17 11:25:09,863 INFO  L134        LiptonReduction]: Checked pairs total: 4774
[2023-11-17 11:25:09,863 INFO  L136        LiptonReduction]: Total number of compositions: 24
[2023-11-17 11:25:09,878 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-17 11:25:09,884 INFO  L357      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=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1ad79cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-17 11:25:09,885 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-11-17 11:25:09,887 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-17 11:25:09,887 INFO  L124   PetriNetUnfolderBase]: 0/4 cut-off events.
[2023-11-17 11:25:09,887 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-17 11:25:09,888 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:09,888 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-11-17 11:25:09,888 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:09,892 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:09,892 INFO  L85        PathProgramCache]: Analyzing trace with hash 397025, now seen corresponding path program 1 times
[2023-11-17 11:25:09,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:09,898 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121285509]
[2023-11-17 11:25:09,899 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:09,899 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:10,008 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:10,195 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:10,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:10,196 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121285509]
[2023-11-17 11:25:10,196 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121285509] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:10,196 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:10,196 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-17 11:25:10,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976696042]
[2023-11-17 11:25:10,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:10,204 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-17 11:25:10,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:10,225 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-17 11:25:10,225 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-17 11:25:10,226 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75
[2023-11-17 11:25:10,228 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand  has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:10,228 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:10,228 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75
[2023-11-17 11:25:10,228 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:11,032 INFO  L124   PetriNetUnfolderBase]: 4903/6743 cut-off events.
[2023-11-17 11:25:11,032 INFO  L125   PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES.
[2023-11-17 11:25:11,041 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13591 conditions, 6743 events. 4903/6743 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 33606 event pairs, 2535 based on Foata normal form. 0/6401 useless extension candidates. Maximal degree in co-relation 13579. Up to 5335 conditions per place. 
[2023-11-17 11:25:11,064 INFO  L140   encePairwiseOnDemand]: 71/75 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions.
[2023-11-17 11:25:11,064 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 211 flow
[2023-11-17 11:25:11,065 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-17 11:25:11,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-17 11:25:11,071 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions.
[2023-11-17 11:25:11,073 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5422222222222223
[2023-11-17 11:25:11,073 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 122 transitions.
[2023-11-17 11:25:11,073 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions.
[2023-11-17 11:25:11,074 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:11,075 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions.
[2023-11-17 11:25:11,077 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:11,079 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:11,079 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:11,080 INFO  L175             Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 122 transitions.
[2023-11-17 11:25:11,081 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 211 flow
[2023-11-17 11:25:11,083 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-11-17 11:25:11,085 INFO  L231             Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow
[2023-11-17 11:25:11,086 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29}
[2023-11-17 11:25:11,088 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places.
[2023-11-17 11:25:11,089 INFO  L495      AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow
[2023-11-17 11:25:11,089 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:11,089 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:11,089 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:25:11,089 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-17 11:25:11,089 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:11,090 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:11,090 INFO  L85        PathProgramCache]: Analyzing trace with hash -6399852, now seen corresponding path program 1 times
[2023-11-17 11:25:11,090 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:11,090 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783274937]
[2023-11-17 11:25:11,090 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:11,090 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:11,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:11,279 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:11,279 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:11,279 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783274937]
[2023-11-17 11:25:11,280 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783274937] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:11,280 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:11,280 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-17 11:25:11,280 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128652008]
[2023-11-17 11:25:11,281 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:11,282 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-17 11:25:11,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:11,282 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-17 11:25:11,283 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-17 11:25:11,283 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75
[2023-11-17 11:25:11,283 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand  has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:11,284 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:11,284 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75
[2023-11-17 11:25:11,284 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:13,601 INFO  L124   PetriNetUnfolderBase]: 20021/27147 cut-off events.
[2023-11-17 11:25:13,601 INFO  L125   PetriNetUnfolderBase]: For 1238/1238 co-relation queries the response was YES.
[2023-11-17 11:25:13,647 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56149 conditions, 27147 events. 20021/27147 cut-off events. For 1238/1238 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 145570 event pairs, 6977 based on Foata normal form. 760/27907 useless extension candidates. Maximal degree in co-relation 56139. Up to 16658 conditions per place. 
[2023-11-17 11:25:13,754 INFO  L140   encePairwiseOnDemand]: 65/75 looper letters, 44 selfloop transitions, 9 changer transitions 0/53 dead transitions.
[2023-11-17 11:25:13,754 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 230 flow
[2023-11-17 11:25:13,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-17 11:25:13,755 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-17 11:25:13,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions.
[2023-11-17 11:25:13,758 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4666666666666667
[2023-11-17 11:25:13,758 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 105 transitions.
[2023-11-17 11:25:13,758 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 105 transitions.
[2023-11-17 11:25:13,759 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:13,759 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 105 transitions.
[2023-11-17 11:25:13,760 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:13,761 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:13,761 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:13,761 INFO  L175             Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 105 transitions.
[2023-11-17 11:25:13,761 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 230 flow
[2023-11-17 11:25:13,762 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-17 11:25:13,763 INFO  L231             Difference]: Finished difference. Result has 42 places, 37 transitions, 136 flow
[2023-11-17 11:25:13,764 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=37}
[2023-11-17 11:25:13,765 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places.
[2023-11-17 11:25:13,765 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 136 flow
[2023-11-17 11:25:13,765 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:13,766 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:13,767 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:25:13,769 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-17 11:25:13,769 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:13,773 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:13,774 INFO  L85        PathProgramCache]: Analyzing trace with hash -198395458, now seen corresponding path program 1 times
[2023-11-17 11:25:13,774 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:13,774 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931707708]
[2023-11-17 11:25:13,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:13,775 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:13,806 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:14,066 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:14,066 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:14,066 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931707708]
[2023-11-17 11:25:14,066 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931707708] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:14,066 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:14,066 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-17 11:25:14,066 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659564073]
[2023-11-17 11:25:14,067 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:14,067 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-17 11:25:14,067 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:14,067 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-17 11:25:14,067 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-17 11:25:14,068 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75
[2023-11-17 11:25:14,068 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 136 flow. Second operand  has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:14,068 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:14,068 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75
[2023-11-17 11:25:14,068 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:15,978 INFO  L124   PetriNetUnfolderBase]: 18540/25160 cut-off events.
[2023-11-17 11:25:15,979 INFO  L125   PetriNetUnfolderBase]: For 11592/11592 co-relation queries the response was YES.
[2023-11-17 11:25:16,018 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63998 conditions, 25160 events. 18540/25160 cut-off events. For 11592/11592 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 130510 event pairs, 4807 based on Foata normal form. 275/25435 useless extension candidates. Maximal degree in co-relation 63986. Up to 10821 conditions per place. 
[2023-11-17 11:25:16,103 INFO  L140   encePairwiseOnDemand]: 66/75 looper letters, 60 selfloop transitions, 9 changer transitions 0/69 dead transitions.
[2023-11-17 11:25:16,103 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 368 flow
[2023-11-17 11:25:16,104 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-17 11:25:16,104 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-17 11:25:16,105 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions.
[2023-11-17 11:25:16,105 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43666666666666665
[2023-11-17 11:25:16,105 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 131 transitions.
[2023-11-17 11:25:16,105 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 131 transitions.
[2023-11-17 11:25:16,105 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:16,105 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 131 transitions.
[2023-11-17 11:25:16,106 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:16,107 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:16,107 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:16,107 INFO  L175             Difference]: Start difference. First operand has 42 places, 37 transitions, 136 flow. Second operand 4 states and 131 transitions.
[2023-11-17 11:25:16,107 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 368 flow
[2023-11-17 11:25:16,174 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-17 11:25:16,175 INFO  L231             Difference]: Finished difference. Result has 46 places, 42 transitions, 186 flow
[2023-11-17 11:25:16,175 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=42}
[2023-11-17 11:25:16,176 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places.
[2023-11-17 11:25:16,176 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 186 flow
[2023-11-17 11:25:16,176 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:16,176 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:16,176 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:25:16,176 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-17 11:25:16,176 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:16,177 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:16,177 INFO  L85        PathProgramCache]: Analyzing trace with hash -1859672744, now seen corresponding path program 1 times
[2023-11-17 11:25:16,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:16,177 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408166232]
[2023-11-17 11:25:16,177 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:16,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:16,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:16,279 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:16,280 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:16,280 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408166232]
[2023-11-17 11:25:16,280 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408166232] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:16,280 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:16,280 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-17 11:25:16,280 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321303004]
[2023-11-17 11:25:16,280 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:16,281 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-17 11:25:16,281 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:16,281 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-17 11:25:16,281 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-17 11:25:16,281 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75
[2023-11-17 11:25:16,282 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 186 flow. Second operand  has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:16,282 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:16,282 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75
[2023-11-17 11:25:16,282 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:18,096 INFO  L124   PetriNetUnfolderBase]: 17488/23740 cut-off events.
[2023-11-17 11:25:18,096 INFO  L125   PetriNetUnfolderBase]: For 18056/18056 co-relation queries the response was YES.
[2023-11-17 11:25:18,150 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63553 conditions, 23740 events. 17488/23740 cut-off events. For 18056/18056 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 125871 event pairs, 3445 based on Foata normal form. 200/23940 useless extension candidates. Maximal degree in co-relation 63538. Up to 10661 conditions per place. 
[2023-11-17 11:25:18,243 INFO  L140   encePairwiseOnDemand]: 66/75 looper letters, 71 selfloop transitions, 13 changer transitions 0/84 dead transitions.
[2023-11-17 11:25:18,243 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 494 flow
[2023-11-17 11:25:18,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-17 11:25:18,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-17 11:25:18,246 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions.
[2023-11-17 11:25:18,247 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4633333333333333
[2023-11-17 11:25:18,247 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 139 transitions.
[2023-11-17 11:25:18,247 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 139 transitions.
[2023-11-17 11:25:18,247 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:18,247 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 139 transitions.
[2023-11-17 11:25:18,248 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:18,249 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:18,249 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:18,249 INFO  L175             Difference]: Start difference. First operand has 46 places, 42 transitions, 186 flow. Second operand 4 states and 139 transitions.
[2023-11-17 11:25:18,249 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 494 flow
[2023-11-17 11:25:18,281 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-17 11:25:18,283 INFO  L231             Difference]: Finished difference. Result has 51 places, 49 transitions, 298 flow
[2023-11-17 11:25:18,283 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=51, PETRI_TRANSITIONS=49}
[2023-11-17 11:25:18,284 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places.
[2023-11-17 11:25:18,284 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 298 flow
[2023-11-17 11:25:18,285 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:18,285 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:18,285 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:25:18,285 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-17 11:25:18,285 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:18,285 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:18,285 INFO  L85        PathProgramCache]: Analyzing trace with hash -936982989, now seen corresponding path program 1 times
[2023-11-17 11:25:18,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:18,396 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697955353]
[2023-11-17 11:25:18,396 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:18,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:18,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:18,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:18,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:18,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697955353]
[2023-11-17 11:25:18,492 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697955353] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:18,492 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:18,492 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-17 11:25:18,492 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277506043]
[2023-11-17 11:25:18,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:18,492 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-17 11:25:18,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:18,493 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-17 11:25:18,493 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-17 11:25:18,493 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75
[2023-11-17 11:25:18,493 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 298 flow. Second operand  has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:18,494 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:18,494 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75
[2023-11-17 11:25:18,494 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:19,035 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L766-->L773: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_129 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_24 256) 0))) (.cse5 (not (= 0 (mod v_~a$r_buff0_thd1~0_27 256))))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_130 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_121 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~a~0_82 (ite .cse0 v_~a$w_buff0~0_52 (ite .cse1 v_~a$w_buff1~0_49 v_~a~0_83))) (= v_~a$w_buff0_used~0_129 (ite .cse0 0 v_~a$w_buff0_used~0_130)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_121) v_~a$w_buff1_used~0_120) (= (ite .cse2 0 v_~a$r_buff0_thd1~0_27) v_~a$r_buff0_thd1~0_26) (= v_~a$r_buff1_thd1~0_23 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_120 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$r_buff0_thd1~0_26 256) 0)))) 0 v_~a$r_buff1_thd1~0_24)))))  InVars {~a~0=v_~a~0_83, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_130, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_121}  OutVars{~a~0=v_~a~0_82, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_129, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_120}  AuxVars[]  AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][41], [86#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 69#true, 91#true, 52#P2EXITtrue, 10#L826true, Black: 75#true, Black: 78#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 25#L773true, 39#L789true, Black: 83#true, P0Thread1of1ForFork1InUse, Black: 85#(= ~__unbuffered_p1_EAX~0 0), 46#L887true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse])
[2023-11-17 11:25:19,036 INFO  L294   olderBase$Statistics]: this new event has 21 ancestors and is cut-off event
[2023-11-17 11:25:19,036 INFO  L297   olderBase$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-11-17 11:25:19,036 INFO  L297   olderBase$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-11-17 11:25:19,036 INFO  L297   olderBase$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-11-17 11:25:19,142 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L766-->L773: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_129 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_24 256) 0))) (.cse5 (not (= 0 (mod v_~a$r_buff0_thd1~0_27 256))))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_130 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_121 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~a~0_82 (ite .cse0 v_~a$w_buff0~0_52 (ite .cse1 v_~a$w_buff1~0_49 v_~a~0_83))) (= v_~a$w_buff0_used~0_129 (ite .cse0 0 v_~a$w_buff0_used~0_130)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_121) v_~a$w_buff1_used~0_120) (= (ite .cse2 0 v_~a$r_buff0_thd1~0_27) v_~a$r_buff0_thd1~0_26) (= v_~a$r_buff1_thd1~0_23 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_120 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$r_buff0_thd1~0_26 256) 0)))) 0 v_~a$r_buff1_thd1~0_24)))))  InVars {~a~0=v_~a~0_83, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_130, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_121}  OutVars{~a~0=v_~a~0_82, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_129, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_120}  AuxVars[]  AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][41], [86#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 69#true, 91#true, 52#P2EXITtrue, Black: 75#true, Black: 77#(<= ~__unbuffered_p3_EAX~0 0), 25#L773true, 78#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 39#L789true, Black: 83#true, P0Thread1of1ForFork1InUse, Black: 85#(= ~__unbuffered_p1_EAX~0 0), 22#L829true, 46#L887true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse])
[2023-11-17 11:25:19,142 INFO  L294   olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-17 11:25:19,142 INFO  L297   olderBase$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-11-17 11:25:19,142 INFO  L297   olderBase$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-11-17 11:25:19,142 INFO  L297   olderBase$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-11-17 11:25:19,143 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L829-->L845: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse4 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse7 (not .cse4)) (.cse10 (and .cse4 (= (mod v_~a$w_buff1_used~0_149 256) 0))) (.cse11 (= (mod v_~a$w_buff0_used~0_162 256) 0)) (.cse3 (and .cse4 .cse9))) (let ((.cse1 (or .cse10 .cse11 .cse3)) (.cse2 (and .cse7 (not .cse11))) (.cse5 (= (mod v_~a$w_buff1_used~0_148 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse6 (= (mod v_~a$w_buff0_used~0_161 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_162 (ite .cse1 v_~a$w_buff0_used~0_162 (ite .cse2 0 v_~a$w_buff0_used~0_162))) v_~a$w_buff0_used~0_161) (= v_~a$w_buff0~0_83 v_~a$w_buff0~0_82) (= (ite .cse1 v_~a~0_111 (ite .cse2 v_~a$w_buff0~0_83 v_~a$w_buff1~0_76)) v_~__unbuffered_p3_EBX~0_18) (= v_~a$w_buff1~0_76 v_~a$w_buff1~0_75) (= v_~a$flush_delayed~0_33 0) (= v_~a$r_buff0_thd4~0_75 (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~a$r_buff0_thd4~0_76 (ite (and .cse7 (not .cse6)) 0 v_~a$r_buff0_thd4~0_76)))) (= v_~a~0_110 (ite .cse0 v_~a$mem_tmp~0_24 v_~__unbuffered_p3_EBX~0_18)) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse8 .cse9) (and .cse8 .cse5) .cse6)) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= (ite .cse0 v_~a$w_buff1_used~0_149 (ite (or .cse10 .cse3 .cse6) v_~a$w_buff1_used~0_149 0)) v_~a$w_buff1_used~0_148) (= v_~a~0_111 v_~a$mem_tmp~0_24)))))  InVars {~a~0=v_~a~0_111, ~a$w_buff1~0=v_~a$w_buff1~0_76, ~a$w_buff0~0=v_~a$w_buff0~0_83, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_162, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76}  OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_161, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_110, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~a$w_buff1~0=v_~a$w_buff1~0_75, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_82, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_40, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|}  AuxVars[]  AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][71], [75#true, 83#true, 32#L766true, 6#L845true, Black: 71#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 91#true, 52#P2EXITtrue, Black: 78#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 77#(<= ~__unbuffered_p3_EAX~0 0), 39#L789true, P0Thread1of1ForFork1InUse, Black: 85#(= ~__unbuffered_p1_EAX~0 0), Black: 86#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 46#L887true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse])
[2023-11-17 11:25:19,143 INFO  L294   olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-17 11:25:19,143 INFO  L297   olderBase$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-11-17 11:25:19,144 INFO  L297   olderBase$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-11-17 11:25:19,144 INFO  L297   olderBase$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-11-17 11:25:19,431 INFO  L124   PetriNetUnfolderBase]: 7617/11418 cut-off events.
[2023-11-17 11:25:19,431 INFO  L125   PetriNetUnfolderBase]: For 10164/11069 co-relation queries the response was YES.
[2023-11-17 11:25:19,464 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29697 conditions, 11418 events. 7617/11418 cut-off events. For 10164/11069 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 70596 event pairs, 1689 based on Foata normal form. 442/11373 useless extension candidates. Maximal degree in co-relation 29678. Up to 9168 conditions per place. 
[2023-11-17 11:25:19,509 INFO  L140   encePairwiseOnDemand]: 69/75 looper letters, 50 selfloop transitions, 5 changer transitions 0/74 dead transitions.
[2023-11-17 11:25:19,509 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 508 flow
[2023-11-17 11:25:19,510 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-17 11:25:19,510 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-17 11:25:19,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions.
[2023-11-17 11:25:19,511 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4622222222222222
[2023-11-17 11:25:19,512 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 104 transitions.
[2023-11-17 11:25:19,512 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 104 transitions.
[2023-11-17 11:25:19,512 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:19,512 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 104 transitions.
[2023-11-17 11:25:19,512 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:19,514 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:19,514 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:19,514 INFO  L175             Difference]: Start difference. First operand has 51 places, 49 transitions, 298 flow. Second operand 3 states and 104 transitions.
[2023-11-17 11:25:19,514 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 508 flow
[2023-11-17 11:25:19,533 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-17 11:25:19,535 INFO  L231             Difference]: Finished difference. Result has 53 places, 53 transitions, 327 flow
[2023-11-17 11:25:19,535 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=53, PETRI_TRANSITIONS=53}
[2023-11-17 11:25:19,537 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places.
[2023-11-17 11:25:19,537 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 327 flow
[2023-11-17 11:25:19,537 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:19,537 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:19,538 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:25:19,538 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-17 11:25:19,538 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:19,538 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:19,538 INFO  L85        PathProgramCache]: Analyzing trace with hash 1156295267, now seen corresponding path program 1 times
[2023-11-17 11:25:19,538 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:19,538 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997801121]
[2023-11-17 11:25:19,538 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:19,539 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:19,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:19,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:19,711 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:19,711 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997801121]
[2023-11-17 11:25:19,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997801121] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:19,711 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:19,711 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-17 11:25:19,711 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638685907]
[2023-11-17 11:25:19,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:19,712 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-17 11:25:19,712 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:19,712 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-17 11:25:19,712 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-17 11:25:19,713 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75
[2023-11-17 11:25:19,713 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 327 flow. Second operand  has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:19,713 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:19,713 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75
[2023-11-17 11:25:19,713 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:20,298 INFO  L124   PetriNetUnfolderBase]: 4122/6546 cut-off events.
[2023-11-17 11:25:20,298 INFO  L125   PetriNetUnfolderBase]: For 5854/6114 co-relation queries the response was YES.
[2023-11-17 11:25:20,312 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19749 conditions, 6546 events. 4122/6546 cut-off events. For 5854/6114 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 40272 event pairs, 961 based on Foata normal form. 536/6807 useless extension candidates. Maximal degree in co-relation 19728. Up to 2484 conditions per place. 
[2023-11-17 11:25:20,330 INFO  L140   encePairwiseOnDemand]: 69/75 looper letters, 69 selfloop transitions, 9 changer transitions 0/97 dead transitions.
[2023-11-17 11:25:20,330 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 97 transitions, 677 flow
[2023-11-17 11:25:20,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-17 11:25:20,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-17 11:25:20,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions.
[2023-11-17 11:25:20,331 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47
[2023-11-17 11:25:20,331 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 141 transitions.
[2023-11-17 11:25:20,332 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 141 transitions.
[2023-11-17 11:25:20,332 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:20,332 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 141 transitions.
[2023-11-17 11:25:20,332 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:20,333 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:20,333 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:20,333 INFO  L175             Difference]: Start difference. First operand has 53 places, 53 transitions, 327 flow. Second operand 4 states and 141 transitions.
[2023-11-17 11:25:20,333 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 97 transitions, 677 flow
[2023-11-17 11:25:20,341 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 672 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-17 11:25:20,342 INFO  L231             Difference]: Finished difference. Result has 56 places, 57 transitions, 374 flow
[2023-11-17 11:25:20,342 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=374, PETRI_PLACES=56, PETRI_TRANSITIONS=57}
[2023-11-17 11:25:20,342 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places.
[2023-11-17 11:25:20,342 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 374 flow
[2023-11-17 11:25:20,343 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:20,343 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:20,343 INFO  L208   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]
[2023-11-17 11:25:20,343 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-17 11:25:20,343 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:20,343 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:20,343 INFO  L85        PathProgramCache]: Analyzing trace with hash -1325621571, now seen corresponding path program 1 times
[2023-11-17 11:25:20,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:20,343 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717270610]
[2023-11-17 11:25:20,343 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:20,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:20,377 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:20,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:20,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:20,523 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717270610]
[2023-11-17 11:25:20,524 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717270610] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:20,524 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:20,524 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-17 11:25:20,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377151423]
[2023-11-17 11:25:20,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:20,524 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-17 11:25:20,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:20,525 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-17 11:25:20,525 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2023-11-17 11:25:20,525 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75
[2023-11-17 11:25:20,525 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 374 flow. Second operand  has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:20,525 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:20,526 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75
[2023-11-17 11:25:20,526 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:21,045 INFO  L124   PetriNetUnfolderBase]: 3262/5154 cut-off events.
[2023-11-17 11:25:21,045 INFO  L125   PetriNetUnfolderBase]: For 7187/7340 co-relation queries the response was YES.
[2023-11-17 11:25:21,062 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16968 conditions, 5154 events. 3262/5154 cut-off events. For 7187/7340 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 31046 event pairs, 857 based on Foata normal form. 224/5127 useless extension candidates. Maximal degree in co-relation 16945. Up to 1989 conditions per place. 
[2023-11-17 11:25:21,084 INFO  L140   encePairwiseOnDemand]: 69/75 looper letters, 83 selfloop transitions, 13 changer transitions 0/115 dead transitions.
[2023-11-17 11:25:21,084 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 115 transitions, 826 flow
[2023-11-17 11:25:21,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-11-17 11:25:21,085 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-17 11:25:21,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions.
[2023-11-17 11:25:21,086 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4693333333333333
[2023-11-17 11:25:21,086 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 176 transitions.
[2023-11-17 11:25:21,086 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 176 transitions.
[2023-11-17 11:25:21,086 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:21,086 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 176 transitions.
[2023-11-17 11:25:21,087 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:21,087 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:21,088 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:21,088 INFO  L175             Difference]: Start difference. First operand has 56 places, 57 transitions, 374 flow. Second operand 5 states and 176 transitions.
[2023-11-17 11:25:21,088 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 115 transitions, 826 flow
[2023-11-17 11:25:21,104 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 115 transitions, 808 flow, removed 4 selfloop flow, removed 2 redundant places.
[2023-11-17 11:25:21,106 INFO  L231             Difference]: Finished difference. Result has 59 places, 61 transitions, 424 flow
[2023-11-17 11:25:21,106 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=424, PETRI_PLACES=59, PETRI_TRANSITIONS=61}
[2023-11-17 11:25:21,107 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places.
[2023-11-17 11:25:21,107 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 424 flow
[2023-11-17 11:25:21,108 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:21,108 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:21,108 INFO  L208   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]
[2023-11-17 11:25:21,108 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-17 11:25:21,109 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:21,109 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:21,109 INFO  L85        PathProgramCache]: Analyzing trace with hash 920632877, now seen corresponding path program 1 times
[2023-11-17 11:25:21,109 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:21,109 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897676168]
[2023-11-17 11:25:21,109 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:21,109 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:21,142 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:21,576 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:21,577 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:21,577 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897676168]
[2023-11-17 11:25:21,577 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897676168] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:21,577 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:21,577 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-17 11:25:21,577 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901415416]
[2023-11-17 11:25:21,577 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:21,578 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-17 11:25:21,578 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:21,578 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-17 11:25:21,578 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-11-17 11:25:21,579 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 24 out of 75
[2023-11-17 11:25:21,579 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 424 flow. Second operand  has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:21,579 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:21,579 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 75
[2023-11-17 11:25:21,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:22,563 INFO  L124   PetriNetUnfolderBase]: 5458/8849 cut-off events.
[2023-11-17 11:25:22,563 INFO  L125   PetriNetUnfolderBase]: For 17676/17979 co-relation queries the response was YES.
[2023-11-17 11:25:22,583 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30976 conditions, 8849 events. 5458/8849 cut-off events. For 17676/17979 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 59730 event pairs, 1063 based on Foata normal form. 88/8679 useless extension candidates. Maximal degree in co-relation 30952. Up to 3713 conditions per place. 
[2023-11-17 11:25:22,606 INFO  L140   encePairwiseOnDemand]: 67/75 looper letters, 99 selfloop transitions, 9 changer transitions 51/178 dead transitions.
[2023-11-17 11:25:22,606 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 178 transitions, 1464 flow
[2023-11-17 11:25:22,606 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-17 11:25:22,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-17 11:25:22,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 254 transitions.
[2023-11-17 11:25:22,607 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4838095238095238
[2023-11-17 11:25:22,607 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 254 transitions.
[2023-11-17 11:25:22,607 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 254 transitions.
[2023-11-17 11:25:22,607 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:22,608 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 254 transitions.
[2023-11-17 11:25:22,608 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:22,609 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 75.0) internal successors, (600), 8 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:22,609 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 75.0) internal successors, (600), 8 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:22,609 INFO  L175             Difference]: Start difference. First operand has 59 places, 61 transitions, 424 flow. Second operand 7 states and 254 transitions.
[2023-11-17 11:25:22,609 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 178 transitions, 1464 flow
[2023-11-17 11:25:22,748 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 178 transitions, 1310 flow, removed 38 selfloop flow, removed 3 redundant places.
[2023-11-17 11:25:22,749 INFO  L231             Difference]: Finished difference. Result has 65 places, 68 transitions, 447 flow
[2023-11-17 11:25:22,750 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=447, PETRI_PLACES=65, PETRI_TRANSITIONS=68}
[2023-11-17 11:25:22,750 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places.
[2023-11-17 11:25:22,750 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 447 flow
[2023-11-17 11:25:22,750 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:22,750 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:22,750 INFO  L208   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]
[2023-11-17 11:25:22,751 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-17 11:25:22,751 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:22,751 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:22,751 INFO  L85        PathProgramCache]: Analyzing trace with hash -1545528995, now seen corresponding path program 1 times
[2023-11-17 11:25:22,751 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:22,751 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961551822]
[2023-11-17 11:25:22,752 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:22,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:22,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:23,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:23,257 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:23,257 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961551822]
[2023-11-17 11:25:23,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961551822] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:23,260 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:23,260 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-17 11:25:23,260 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097794098]
[2023-11-17 11:25:23,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:23,260 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-17 11:25:23,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:23,261 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-17 11:25:23,261 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-17 11:25:23,262 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 75
[2023-11-17 11:25:23,262 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 447 flow. Second operand  has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:23,262 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:23,262 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 75
[2023-11-17 11:25:23,262 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:24,653 INFO  L124   PetriNetUnfolderBase]: 10033/15016 cut-off events.
[2023-11-17 11:25:24,654 INFO  L125   PetriNetUnfolderBase]: For 35055/35055 co-relation queries the response was YES.
[2023-11-17 11:25:24,688 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59606 conditions, 15016 events. 10033/15016 cut-off events. For 35055/35055 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 90328 event pairs, 1163 based on Foata normal form. 16/15032 useless extension candidates. Maximal degree in co-relation 59579. Up to 5204 conditions per place. 
[2023-11-17 11:25:24,726 INFO  L140   encePairwiseOnDemand]: 58/75 looper letters, 131 selfloop transitions, 43 changer transitions 143/317 dead transitions.
[2023-11-17 11:25:24,726 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 317 transitions, 2543 flow
[2023-11-17 11:25:24,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-11-17 11:25:24,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-11-17 11:25:24,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 357 transitions.
[2023-11-17 11:25:24,728 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43272727272727274
[2023-11-17 11:25:24,728 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 357 transitions.
[2023-11-17 11:25:24,728 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 357 transitions.
[2023-11-17 11:25:24,728 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:24,728 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 357 transitions.
[2023-11-17 11:25:24,729 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:24,730 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 75.0) internal successors, (900), 12 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:24,730 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 75.0) internal successors, (900), 12 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:24,730 INFO  L175             Difference]: Start difference. First operand has 65 places, 68 transitions, 447 flow. Second operand 11 states and 357 transitions.
[2023-11-17 11:25:24,731 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 317 transitions, 2543 flow
[2023-11-17 11:25:25,011 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 317 transitions, 2538 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-11-17 11:25:25,014 INFO  L231             Difference]: Finished difference. Result has 78 places, 89 transitions, 756 flow
[2023-11-17 11:25:25,015 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=756, PETRI_PLACES=78, PETRI_TRANSITIONS=89}
[2023-11-17 11:25:25,015 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places.
[2023-11-17 11:25:25,015 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 89 transitions, 756 flow
[2023-11-17 11:25:25,015 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:25,015 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:25,015 INFO  L208   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]
[2023-11-17 11:25:25,016 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-17 11:25:25,016 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:25,016 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:25,016 INFO  L85        PathProgramCache]: Analyzing trace with hash -1963920569, now seen corresponding path program 2 times
[2023-11-17 11:25:25,016 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:25,016 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194630881]
[2023-11-17 11:25:25,016 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:25,016 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:25,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:25,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:25,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:25,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194630881]
[2023-11-17 11:25:25,850 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194630881] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:25,850 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:25,850 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-17 11:25:25,850 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866927440]
[2023-11-17 11:25:25,850 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:25,851 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-17 11:25:25,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:25,851 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-17 11:25:25,851 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2023-11-17 11:25:25,852 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 24 out of 75
[2023-11-17 11:25:25,853 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 89 transitions, 756 flow. Second operand  has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:25,853 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:25,853 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 75
[2023-11-17 11:25:25,853 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:27,055 INFO  L124   PetriNetUnfolderBase]: 5946/9818 cut-off events.
[2023-11-17 11:25:27,055 INFO  L125   PetriNetUnfolderBase]: For 29260/30012 co-relation queries the response was YES.
[2023-11-17 11:25:27,087 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41996 conditions, 9818 events. 5946/9818 cut-off events. For 29260/30012 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 67957 event pairs, 819 based on Foata normal form. 192/9753 useless extension candidates. Maximal degree in co-relation 41962. Up to 4081 conditions per place. 
[2023-11-17 11:25:27,120 INFO  L140   encePairwiseOnDemand]: 67/75 looper letters, 134 selfloop transitions, 19 changer transitions 44/224 dead transitions.
[2023-11-17 11:25:27,120 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 224 transitions, 1976 flow
[2023-11-17 11:25:27,121 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-17 11:25:27,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-17 11:25:27,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 265 transitions.
[2023-11-17 11:25:27,122 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5047619047619047
[2023-11-17 11:25:27,122 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 265 transitions.
[2023-11-17 11:25:27,122 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 265 transitions.
[2023-11-17 11:25:27,122 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:27,122 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 265 transitions.
[2023-11-17 11:25:27,123 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 37.857142857142854) internal successors, (265), 7 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:27,124 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 75.0) internal successors, (600), 8 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:27,124 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 75.0) internal successors, (600), 8 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:27,124 INFO  L175             Difference]: Start difference. First operand has 78 places, 89 transitions, 756 flow. Second operand 7 states and 265 transitions.
[2023-11-17 11:25:27,124 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 224 transitions, 1976 flow
[2023-11-17 11:25:27,327 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 224 transitions, 1956 flow, removed 10 selfloop flow, removed 2 redundant places.
[2023-11-17 11:25:27,330 INFO  L231             Difference]: Finished difference. Result has 82 places, 103 transitions, 942 flow
[2023-11-17 11:25:27,330 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=942, PETRI_PLACES=82, PETRI_TRANSITIONS=103}
[2023-11-17 11:25:27,330 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places.
[2023-11-17 11:25:27,330 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 103 transitions, 942 flow
[2023-11-17 11:25:27,330 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:27,331 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:27,331 INFO  L208   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]
[2023-11-17 11:25:27,331 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-17 11:25:27,331 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:27,331 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:27,331 INFO  L85        PathProgramCache]: Analyzing trace with hash 909098055, now seen corresponding path program 2 times
[2023-11-17 11:25:27,331 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:27,331 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207666322]
[2023-11-17 11:25:27,331 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:27,331 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:27,349 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:27,455 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:27,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:27,456 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207666322]
[2023-11-17 11:25:27,456 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207666322] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:27,456 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:27,456 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-17 11:25:27,456 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201566568]
[2023-11-17 11:25:27,456 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:27,456 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-17 11:25:27,456 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:27,457 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-17 11:25:27,457 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-17 11:25:27,457 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 75
[2023-11-17 11:25:27,457 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 103 transitions, 942 flow. Second operand  has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:27,457 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:27,457 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 75
[2023-11-17 11:25:27,457 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:28,673 INFO  L124   PetriNetUnfolderBase]: 8030/12769 cut-off events.
[2023-11-17 11:25:28,674 INFO  L125   PetriNetUnfolderBase]: For 59052/59958 co-relation queries the response was YES.
[2023-11-17 11:25:28,752 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61199 conditions, 12769 events. 8030/12769 cut-off events. For 59052/59958 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 87797 event pairs, 1276 based on Foata normal form. 208/12667 useless extension candidates. Maximal degree in co-relation 61161. Up to 6579 conditions per place. 
[2023-11-17 11:25:28,792 INFO  L140   encePairwiseOnDemand]: 72/75 looper letters, 113 selfloop transitions, 4 changer transitions 47/188 dead transitions.
[2023-11-17 11:25:28,792 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 188 transitions, 1952 flow
[2023-11-17 11:25:28,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-17 11:25:28,793 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-17 11:25:28,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions.
[2023-11-17 11:25:28,793 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48
[2023-11-17 11:25:28,793 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 144 transitions.
[2023-11-17 11:25:28,793 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 144 transitions.
[2023-11-17 11:25:28,793 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:28,793 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 144 transitions.
[2023-11-17 11:25:28,794 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:28,794 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:28,794 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:28,795 INFO  L175             Difference]: Start difference. First operand has 82 places, 103 transitions, 942 flow. Second operand 4 states and 144 transitions.
[2023-11-17 11:25:28,795 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 188 transitions, 1952 flow
[2023-11-17 11:25:29,103 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 188 transitions, 1888 flow, removed 15 selfloop flow, removed 4 redundant places.
[2023-11-17 11:25:29,105 INFO  L231             Difference]: Finished difference. Result has 81 places, 104 transitions, 939 flow
[2023-11-17 11:25:29,105 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=939, PETRI_PLACES=81, PETRI_TRANSITIONS=104}
[2023-11-17 11:25:29,105 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places.
[2023-11-17 11:25:29,105 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 104 transitions, 939 flow
[2023-11-17 11:25:29,106 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:29,106 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:29,106 INFO  L208   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]
[2023-11-17 11:25:29,106 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-17 11:25:29,106 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:29,106 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:29,106 INFO  L85        PathProgramCache]: Analyzing trace with hash 936759633, now seen corresponding path program 1 times
[2023-11-17 11:25:29,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:29,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475150098]
[2023-11-17 11:25:29,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:29,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:29,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:29,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:29,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:29,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475150098]
[2023-11-17 11:25:29,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475150098] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:29,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:29,265 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-17 11:25:29,265 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500991837]
[2023-11-17 11:25:29,265 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:29,265 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-17 11:25:29,265 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:29,266 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-17 11:25:29,266 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-17 11:25:29,266 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75
[2023-11-17 11:25:29,266 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 104 transitions, 939 flow. Second operand  has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:29,266 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:29,266 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75
[2023-11-17 11:25:29,266 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:31,910 INFO  L124   PetriNetUnfolderBase]: 14523/22241 cut-off events.
[2023-11-17 11:25:31,910 INFO  L125   PetriNetUnfolderBase]: For 99128/99128 co-relation queries the response was YES.
[2023-11-17 11:25:31,999 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109536 conditions, 22241 events. 14523/22241 cut-off events. For 99128/99128 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 148471 event pairs, 2888 based on Foata normal form. 14/22255 useless extension candidates. Maximal degree in co-relation 109499. Up to 11007 conditions per place. 
[2023-11-17 11:25:32,038 INFO  L140   encePairwiseOnDemand]: 65/75 looper letters, 139 selfloop transitions, 33 changer transitions 47/219 dead transitions.
[2023-11-17 11:25:32,038 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 219 transitions, 2275 flow
[2023-11-17 11:25:32,038 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-17 11:25:32,039 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-17 11:25:32,039 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions.
[2023-11-17 11:25:32,040 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47333333333333333
[2023-11-17 11:25:32,040 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 142 transitions.
[2023-11-17 11:25:32,040 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 142 transitions.
[2023-11-17 11:25:32,040 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:32,040 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 142 transitions.
[2023-11-17 11:25:32,041 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:32,046 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:32,046 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:32,046 INFO  L175             Difference]: Start difference. First operand has 81 places, 104 transitions, 939 flow. Second operand 4 states and 142 transitions.
[2023-11-17 11:25:32,046 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 219 transitions, 2275 flow
[2023-11-17 11:25:32,629 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 219 transitions, 2269 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-11-17 11:25:32,724 INFO  L231             Difference]: Finished difference. Result has 86 places, 103 transitions, 1033 flow
[2023-11-17 11:25:32,725 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1033, PETRI_PLACES=86, PETRI_TRANSITIONS=103}
[2023-11-17 11:25:32,725 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places.
[2023-11-17 11:25:32,725 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 103 transitions, 1033 flow
[2023-11-17 11:25:32,725 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:32,725 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:32,725 INFO  L208   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]
[2023-11-17 11:25:32,726 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-17 11:25:32,726 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:32,726 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:32,726 INFO  L85        PathProgramCache]: Analyzing trace with hash -1355402757, now seen corresponding path program 3 times
[2023-11-17 11:25:32,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:32,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229611021]
[2023-11-17 11:25:32,726 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:32,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:32,795 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:32,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:32,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:32,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229611021]
[2023-11-17 11:25:32,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229611021] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:32,962 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:32,962 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-17 11:25:32,962 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269815457]
[2023-11-17 11:25:32,962 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:32,962 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-17 11:25:32,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:32,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-17 11:25:32,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-17 11:25:32,964 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75
[2023-11-17 11:25:32,964 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 103 transitions, 1033 flow. Second operand  has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:32,964 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:32,964 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75
[2023-11-17 11:25:32,964 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:34,389 INFO  L124   PetriNetUnfolderBase]: 7470/12358 cut-off events.
[2023-11-17 11:25:34,389 INFO  L125   PetriNetUnfolderBase]: For 57617/58956 co-relation queries the response was YES.
[2023-11-17 11:25:34,437 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59535 conditions, 12358 events. 7470/12358 cut-off events. For 57617/58956 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 93029 event pairs, 842 based on Foata normal form. 309/12291 useless extension candidates. Maximal degree in co-relation 59494. Up to 4876 conditions per place. 
[2023-11-17 11:25:34,454 INFO  L140   encePairwiseOnDemand]: 69/75 looper letters, 117 selfloop transitions, 17 changer transitions 53/207 dead transitions.
[2023-11-17 11:25:34,455 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 207 transitions, 2394 flow
[2023-11-17 11:25:34,455 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-17 11:25:34,455 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-17 11:25:34,456 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions.
[2023-11-17 11:25:34,456 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43555555555555553
[2023-11-17 11:25:34,456 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 196 transitions.
[2023-11-17 11:25:34,456 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 196 transitions.
[2023-11-17 11:25:34,457 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:34,457 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 196 transitions.
[2023-11-17 11:25:34,457 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:34,458 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:34,458 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:34,458 INFO  L175             Difference]: Start difference. First operand has 86 places, 103 transitions, 1033 flow. Second operand 6 states and 196 transitions.
[2023-11-17 11:25:34,458 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 207 transitions, 2394 flow
[2023-11-17 11:25:35,106 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 207 transitions, 2354 flow, removed 15 selfloop flow, removed 2 redundant places.
[2023-11-17 11:25:35,111 INFO  L231             Difference]: Finished difference. Result has 90 places, 81 transitions, 787 flow
[2023-11-17 11:25:35,111 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=787, PETRI_PLACES=90, PETRI_TRANSITIONS=81}
[2023-11-17 11:25:35,112 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 46 predicate places.
[2023-11-17 11:25:35,112 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 787 flow
[2023-11-17 11:25:35,113 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:35,113 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:35,113 INFO  L208   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]
[2023-11-17 11:25:35,117 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-17 11:25:35,117 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:35,118 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:35,118 INFO  L85        PathProgramCache]: Analyzing trace with hash 1766768703, now seen corresponding path program 1 times
[2023-11-17 11:25:35,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:35,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987670363]
[2023-11-17 11:25:35,118 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:35,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:35,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:35,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:35,549 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:35,549 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987670363]
[2023-11-17 11:25:35,549 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987670363] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:35,549 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:35,549 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-17 11:25:35,549 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189938608]
[2023-11-17 11:25:35,549 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:35,550 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-17 11:25:35,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:35,551 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-17 11:25:35,551 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-17 11:25:35,551 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75
[2023-11-17 11:25:35,552 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 787 flow. Second operand  has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:35,552 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:35,552 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75
[2023-11-17 11:25:35,552 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:36,766 INFO  L124   PetriNetUnfolderBase]: 5994/9795 cut-off events.
[2023-11-17 11:25:36,766 INFO  L125   PetriNetUnfolderBase]: For 51526/51732 co-relation queries the response was YES.
[2023-11-17 11:25:36,794 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49831 conditions, 9795 events. 5994/9795 cut-off events. For 51526/51732 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 65200 event pairs, 1580 based on Foata normal form. 25/9699 useless extension candidates. Maximal degree in co-relation 49789. Up to 5855 conditions per place. 
[2023-11-17 11:25:36,806 INFO  L140   encePairwiseOnDemand]: 72/75 looper letters, 56 selfloop transitions, 2 changer transitions 66/127 dead transitions.
[2023-11-17 11:25:36,806 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 127 transitions, 1391 flow
[2023-11-17 11:25:36,806 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-17 11:25:36,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-17 11:25:36,807 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions.
[2023-11-17 11:25:36,807 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49333333333333335
[2023-11-17 11:25:36,807 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 111 transitions.
[2023-11-17 11:25:36,807 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions.
[2023-11-17 11:25:36,807 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:36,807 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions.
[2023-11-17 11:25:36,807 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:36,809 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:36,809 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:36,809 INFO  L175             Difference]: Start difference. First operand has 90 places, 81 transitions, 787 flow. Second operand 3 states and 111 transitions.
[2023-11-17 11:25:36,809 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 127 transitions, 1391 flow
[2023-11-17 11:25:37,042 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 127 transitions, 1247 flow, removed 37 selfloop flow, removed 6 redundant places.
[2023-11-17 11:25:37,045 INFO  L231             Difference]: Finished difference. Result has 87 places, 53 transitions, 378 flow
[2023-11-17 11:25:37,045 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=87, PETRI_TRANSITIONS=53}
[2023-11-17 11:25:37,046 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places.
[2023-11-17 11:25:37,046 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 53 transitions, 378 flow
[2023-11-17 11:25:37,047 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:37,047 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:37,047 INFO  L208   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]
[2023-11-17 11:25:37,047 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-17 11:25:37,047 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:37,047 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:37,047 INFO  L85        PathProgramCache]: Analyzing trace with hash 432857753, now seen corresponding path program 2 times
[2023-11-17 11:25:37,047 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:37,047 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667011848]
[2023-11-17 11:25:37,048 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:37,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:37,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:37,871 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:37,872 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:37,872 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667011848]
[2023-11-17 11:25:37,872 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667011848] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:37,872 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:37,872 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-17 11:25:37,872 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444543431]
[2023-11-17 11:25:37,872 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:37,872 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-17 11:25:37,872 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:37,873 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-17 11:25:37,873 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2023-11-17 11:25:37,873 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 24 out of 75
[2023-11-17 11:25:37,873 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 53 transitions, 378 flow. Second operand  has 8 states, 8 states have (on average 27.0) internal successors, (216), 8 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:37,873 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:37,873 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 75
[2023-11-17 11:25:37,873 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:38,125 INFO  L124   PetriNetUnfolderBase]: 615/1051 cut-off events.
[2023-11-17 11:25:38,126 INFO  L125   PetriNetUnfolderBase]: For 3759/3883 co-relation queries the response was YES.
[2023-11-17 11:25:38,128 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4703 conditions, 1051 events. 615/1051 cut-off events. For 3759/3883 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4461 event pairs, 110 based on Foata normal form. 62/1095 useless extension candidates. Maximal degree in co-relation 4677. Up to 436 conditions per place. 
[2023-11-17 11:25:38,130 INFO  L140   encePairwiseOnDemand]: 69/75 looper letters, 52 selfloop transitions, 4 changer transitions 56/117 dead transitions.
[2023-11-17 11:25:38,130 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 117 transitions, 971 flow
[2023-11-17 11:25:38,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-17 11:25:38,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-17 11:25:38,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 231 transitions.
[2023-11-17 11:25:38,131 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44
[2023-11-17 11:25:38,131 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 231 transitions.
[2023-11-17 11:25:38,131 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 231 transitions.
[2023-11-17 11:25:38,131 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:38,131 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 231 transitions.
[2023-11-17 11:25:38,133 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:38,133 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 75.0) internal successors, (600), 8 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:38,133 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 75.0) internal successors, (600), 8 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:38,134 INFO  L175             Difference]: Start difference. First operand has 87 places, 53 transitions, 378 flow. Second operand 7 states and 231 transitions.
[2023-11-17 11:25:38,134 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 117 transitions, 971 flow
[2023-11-17 11:25:38,140 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 117 transitions, 883 flow, removed 16 selfloop flow, removed 16 redundant places.
[2023-11-17 11:25:38,141 INFO  L231             Difference]: Finished difference. Result has 75 places, 49 transitions, 294 flow
[2023-11-17 11:25:38,141 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=294, PETRI_PLACES=75, PETRI_TRANSITIONS=49}
[2023-11-17 11:25:38,143 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places.
[2023-11-17 11:25:38,143 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 49 transitions, 294 flow
[2023-11-17 11:25:38,143 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 27.0) internal successors, (216), 8 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:38,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:38,143 INFO  L208   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]
[2023-11-17 11:25:38,143 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-17 11:25:38,143 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:38,143 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:38,144 INFO  L85        PathProgramCache]: Analyzing trace with hash -55584487, now seen corresponding path program 3 times
[2023-11-17 11:25:38,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:38,148 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84116911]
[2023-11-17 11:25:38,148 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:38,148 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:38,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-17 11:25:38,188 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-17 11:25:38,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-17 11:25:38,273 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-17 11:25:38,275 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-17 11:25:38,276 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2023-11-17 11:25:38,277 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2023-11-17 11:25:38,278 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2023-11-17 11:25:38,278 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2023-11-17 11:25:38,278 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2023-11-17 11:25:38,278 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2023-11-17 11:25:38,278 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2023-11-17 11:25:38,279 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-11-17 11:25:38,279 INFO  L445         BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:25:38,283 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-17 11:25:38,283 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-11-17 11:25:38,331 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-17 11:25:38,332 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-17 11:25:38,334 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-17 11:25:38,338 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
[2023-11-17 11:25:38,365 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:25:38 BasicIcfg
[2023-11-17 11:25:38,365 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-17 11:25:38,365 INFO  L158              Benchmark]: Toolchain (without parser) took 30810.12ms. Allocated memory was 404.8MB in the beginning and 4.9GB in the end (delta: 4.5GB). Free memory was 351.4MB in the beginning and 3.8GB in the end (delta: -3.4GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB.
[2023-11-17 11:25:38,365 INFO  L158              Benchmark]: CDTParser took 1.68ms. Allocated memory is still 205.5MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB.
[2023-11-17 11:25:38,366 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 438.36ms. Allocated memory is still 404.8MB. Free memory was 351.4MB in the beginning and 327.1MB in the end (delta: 24.3MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB.
[2023-11-17 11:25:38,366 INFO  L158              Benchmark]: Boogie Procedure Inliner took 48.00ms. Allocated memory is still 404.8MB. Free memory was 327.1MB in the beginning and 324.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2023-11-17 11:25:38,366 INFO  L158              Benchmark]: Boogie Preprocessor took 38.47ms. Allocated memory is still 404.8MB. Free memory was 324.6MB in the beginning and 322.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2023-11-17 11:25:38,366 INFO  L158              Benchmark]: RCFGBuilder took 724.35ms. Allocated memory is still 404.8MB. Free memory was 322.5MB in the beginning and 339.8MB in the end (delta: -17.3MB). Peak memory consumption was 25.1MB. Max. memory is 8.0GB.
[2023-11-17 11:25:38,366 INFO  L158              Benchmark]: TraceAbstraction took 29553.20ms. Allocated memory was 404.8MB in the beginning and 4.9GB in the end (delta: 4.5GB). Free memory was 338.7MB in the beginning and 3.8GB in the end (delta: -3.4GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB.
[2023-11-17 11:25:38,367 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 1.68ms. Allocated memory is still 205.5MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 438.36ms. Allocated memory is still 404.8MB. Free memory was 351.4MB in the beginning and 327.1MB in the end (delta: 24.3MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 48.00ms. Allocated memory is still 404.8MB. Free memory was 327.1MB in the beginning and 324.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 38.47ms. Allocated memory is still 404.8MB. Free memory was 324.6MB in the beginning and 322.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 724.35ms. Allocated memory is still 404.8MB. Free memory was 322.5MB in the beginning and 339.8MB in the end (delta: -17.3MB). Peak memory consumption was 25.1MB. Max. memory is 8.0GB.
 * TraceAbstraction took 29553.20ms. Allocated memory was 404.8MB in the beginning and 4.9GB in the end (delta: 4.5GB). Free memory was 338.7MB in the beginning and 3.8GB in the end (delta: -3.4GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.9s, 58 PlacesBefore, 44 PlacesAfterwards, 47 TransitionsBefore, 32 TransitionsAfterwards, 1378 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 24 TotalNumberOfCompositions, 4774 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1731, independent: 1574, independent conditional: 0, independent unconditional: 1574, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 928, independent: 867, independent conditional: 0, independent unconditional: 867, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 928, independent: 809, independent conditional: 0, independent unconditional: 809, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 119, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 330, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 1731, independent: 707, independent conditional: 0, independent unconditional: 707, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 928, unknown conditional: 0, unknown unconditional: 928] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 178, Positive conditional cache size: 0, Positive unconditional cache size: 178, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p1_EAX = 0;
[L714]               0  int __unbuffered_p1_EBX = 0;
[L716]               0  int __unbuffered_p3_EAX = 0;
[L718]               0  int __unbuffered_p3_EBX = 0;
[L720]               0  int a = 0;
[L721]               0  _Bool a$flush_delayed;
[L722]               0  int a$mem_tmp;
[L723]               0  _Bool a$r_buff0_thd0;
[L724]               0  _Bool a$r_buff0_thd1;
[L725]               0  _Bool a$r_buff0_thd2;
[L726]               0  _Bool a$r_buff0_thd3;
[L727]               0  _Bool a$r_buff0_thd4;
[L728]               0  _Bool a$r_buff1_thd0;
[L729]               0  _Bool a$r_buff1_thd1;
[L730]               0  _Bool a$r_buff1_thd2;
[L731]               0  _Bool a$r_buff1_thd3;
[L732]               0  _Bool a$r_buff1_thd4;
[L733]               0  _Bool a$read_delayed;
[L734]               0  int *a$read_delayed_var;
[L735]               0  int a$w_buff0;
[L736]               0  _Bool a$w_buff0_used;
[L737]               0  int a$w_buff1;
[L738]               0  _Bool a$w_buff1_used;
[L739]               0  _Bool main$tmp_guard0;
[L740]               0  _Bool main$tmp_guard1;
[L742]               0  int x = 0;
[L744]               0  int y = 0;
[L746]               0  int z = 0;
[L747]               0  _Bool weak$$choice0;
[L748]               0  _Bool weak$$choice2;
[L869]               0  pthread_t t601;
[L870]  FCALL, FORK  0  pthread_create(&t601, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L871]               0  pthread_t t602;
[L872]  FCALL, FORK  0  pthread_create(&t602, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t601={5:0}, t602={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L873]               0  pthread_t t603;
[L874]  FCALL, FORK  0  pthread_create(&t603, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t601={5:0}, t602={6:0}, t603={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L875]               0  pthread_t t604;
[L876]  FCALL, FORK  0  pthread_create(&t604, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L752]               1  a$w_buff1 = a$w_buff0
[L753]               1  a$w_buff0 = 1
[L754]               1  a$w_buff1_used = a$w_buff0_used
[L755]               1  a$w_buff0_used = (_Bool)1
[L756]  CALL         1  __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L18]   COND FALSE   1  !(!expression)
[L756]  RET          1  __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L757]               1  a$r_buff1_thd0 = a$r_buff0_thd0
[L758]               1  a$r_buff1_thd1 = a$r_buff0_thd1
[L759]               1  a$r_buff1_thd2 = a$r_buff0_thd2
[L760]               1  a$r_buff1_thd3 = a$r_buff0_thd3
[L761]               1  a$r_buff1_thd4 = a$r_buff0_thd4
[L762]               1  a$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, weak$$choice2=0, x=0, y=0, z=0]
[L765]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, weak$$choice2=0, x=1, y=0, z=0]
[L782]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0]
[L785]               2  __unbuffered_p1_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0]
[L788]               2  __unbuffered_p1_EBX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0]
[L805]               3  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, weak$$choice2=0, x=2, y=1, z=0]
[L808]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, weak$$choice2=0, x=2, y=1, z=1]
[L825]               4  z = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, weak$$choice2=0, x=2, y=1, z=2]
[L791]               2  a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L792]               2  a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L793]               2  a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L794]               2  a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L795]               2  a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, weak$$choice2=0, x=2, y=1, z=2]
[L798]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L800]               2  return 0;
[L828]               4  __unbuffered_p3_EAX = z
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, weak$$choice2=0, x=2, y=1, z=2]
[L811]               3  a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a)
[L812]               3  a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used
[L813]               3  a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used
[L814]               3  a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3
[L815]               3  a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, weak$$choice2=0, x=2, y=1, z=2]
[L818]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L820]               3  return 0;
[L831]               4  weak$$choice0 = __VERIFIER_nondet_bool()
[L832]               4  weak$$choice2 = __VERIFIER_nondet_bool()
[L833]               4  a$flush_delayed = weak$$choice2
[L834]               4  a$mem_tmp = a
[L835]               4  a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1)
[L836]               4  a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0))
[L837]               4  a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1))
[L838]               4  a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used))
[L839]               4  a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L840]               4  a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4))
[L841]               4  a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L842]               4  __unbuffered_p3_EBX = a
[L843]               4  a = a$flush_delayed ? a$mem_tmp : a
[L844]               4  a$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=2, y=1, z=2]
[L847]               4  a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a)
[L848]               4  a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used
[L849]               4  a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used
[L850]               4  a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4
[L851]               4  a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=2, y=1, z=2]
[L768]               1  a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a)
[L769]               1  a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L770]               1  a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L771]               1  a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L772]               1  a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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$$choice2=1, x=2, y=1, z=2]
[L775]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L777]               1  return 0;
[L854]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L856]               4  return 0;
[L878]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L880]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L880]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L882]               0  a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L883]               0  a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L884]               0  a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L885]               0  a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L886]               0  a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice2=1, x=2, y=1, z=2]
[L889]               0  main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
[L891]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
[L18]                0  reach_error()
        VAL             [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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$$choice2=1, x=2, y=1, z=2]

  - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 9 procedures, 85 locations, 7 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: 29.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 530 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2123 IncrementalHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 44 mSDtfsCounter, 2123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1033occurred in iteration=12, InterpolantAutomatonStates: 75, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 2040 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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!
[2023-11-17 11:25:38,385 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...