/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:35:39,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:35:39,224 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-VariableLbe.epf [2023-08-24 05:35:39,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:35:39,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:35:39,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:35:39,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:35:39,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:35:39,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:35:39,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:35:39,255 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:35:39,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:35:39,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:35:39,256 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:35:39,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:35:39,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:35:39,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:35:39,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:35:39,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:35:39,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:35:39,258 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:35:39,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:35:39,258 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:35:39,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:35:39,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:35:39,259 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:35:39,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:35:39,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:35:39,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:35:39,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:35:39,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:35:39,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:35:39,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:35:39,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:35:39,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:35:39,261 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:35:39,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:35:39,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:35:39,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:35:39,530 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:35:39,530 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:35:39,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.opt.i [2023-08-24 05:35:40,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:35:40,959 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:35:40,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.opt.i [2023-08-24 05:35:40,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbd29ade6/d0b7d7dd15744dfc940b1c758e43dca0/FLAG5d25497b3 [2023-08-24 05:35:40,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbd29ade6/d0b7d7dd15744dfc940b1c758e43dca0 [2023-08-24 05:35:40,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:35:40,994 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:35:40,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:35:40,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:35:40,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:35:40,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:35:40" (1/1) ... [2023-08-24 05:35:40,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e8424bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:40, skipping insertion in model container [2023-08-24 05:35:40,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:35:40" (1/1) ... [2023-08-24 05:35:41,034 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:35:41,146 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/safe016_rmo.opt.i[949,962] [2023-08-24 05:35:41,341 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:35:41,357 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:35:41,365 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/safe016_rmo.opt.i[949,962] [2023-08-24 05:35:41,382 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:35:41,383 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:35:41,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:35:41,436 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:35:41,436 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:35:41,442 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:35:41,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41 WrapperNode [2023-08-24 05:35:41,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:35:41,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:35:41,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:35:41,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:35:41,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,481 INFO L138 Inliner]: procedures = 177, calls = 89, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 184 [2023-08-24 05:35:41,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:35:41,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:35:41,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:35:41,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:35:41,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:35:41,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:35:41,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:35:41,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:35:41,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (1/1) ... [2023-08-24 05:35:41,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:35:41,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:35:41,559 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-08-24 05:35:41,561 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-08-24 05:35:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 05:35:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:35:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:35:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:35:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:35:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:35:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:35:41,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:35:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:35:41,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:35:41,603 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:35:41,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:35:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 05:35:41,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 05:35:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:35:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:35:41,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:35:41,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:35:41,617 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:35:41,751 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:35:41,752 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:35:42,068 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:35:42,225 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:35:42,225 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:35:42,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:35:42 BoogieIcfgContainer [2023-08-24 05:35:42,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:35:42,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:35:42,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:35:42,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:35:42,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:35:40" (1/3) ... [2023-08-24 05:35:42,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64df2b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:35:42, skipping insertion in model container [2023-08-24 05:35:42,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:35:41" (2/3) ... [2023-08-24 05:35:42,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64df2b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:35:42, skipping insertion in model container [2023-08-24 05:35:42,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:35:42" (3/3) ... [2023-08-24 05:35:42,234 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_rmo.opt.i [2023-08-24 05:35:42,245 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:35:42,246 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 05:35:42,246 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:35:42,328 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:35:42,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2023-08-24 05:35:42,397 INFO L124 PetriNetUnfolderBase]: 2/140 cut-off events. [2023-08-24 05:35:42,398 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:35:42,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-08-24 05:35:42,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2023-08-24 05:35:42,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 126 transitions, 264 flow [2023-08-24 05:35:42,407 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:35:42,421 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 126 transitions, 264 flow [2023-08-24 05:35:42,423 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 126 transitions, 264 flow [2023-08-24 05:35:42,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 126 transitions, 264 flow [2023-08-24 05:35:42,446 INFO L124 PetriNetUnfolderBase]: 1/126 cut-off events. [2023-08-24 05:35:42,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:35:42,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 1/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-08-24 05:35:42,448 INFO L119 LiptonReduction]: Number of co-enabled transitions 1950 [2023-08-24 05:35:46,826 INFO L134 LiptonReduction]: Checked pairs total: 6399 [2023-08-24 05:35:46,826 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-08-24 05:35:46,842 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:35:46,848 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@77f0302f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:35:46,849 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 05:35:46,855 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:35:46,855 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2023-08-24 05:35:46,855 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:35:46,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:46,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:46,856 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:35:46,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:46,860 INFO L85 PathProgramCache]: Analyzing trace with hash 738848465, now seen corresponding path program 1 times [2023-08-24 05:35:46,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:46,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456501670] [2023-08-24 05:35:46,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:46,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:35:47,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:47,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456501670] [2023-08-24 05:35:47,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456501670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:47,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:47,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:35:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308737705] [2023-08-24 05:35:47,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:47,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:35:47,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:47,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:35:47,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:35:47,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 247 [2023-08-24 05:35:47,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 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-08-24 05:35:47,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:47,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 247 [2023-08-24 05:35:47,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:48,443 INFO L124 PetriNetUnfolderBase]: 4855/7058 cut-off events. [2023-08-24 05:35:48,444 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-24 05:35:48,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13922 conditions, 7058 events. 4855/7058 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 39267 event pairs, 823 based on Foata normal form. 512/7310 useless extension candidates. Maximal degree in co-relation 13910. Up to 4991 conditions per place. [2023-08-24 05:35:48,476 INFO L140 encePairwiseOnDemand]: 242/247 looper letters, 39 selfloop transitions, 2 changer transitions 24/67 dead transitions. [2023-08-24 05:35:48,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 67 transitions, 285 flow [2023-08-24 05:35:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:35:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:35:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 699 transitions. [2023-08-24 05:35:48,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5659919028340081 [2023-08-24 05:35:48,489 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 699 transitions. [2023-08-24 05:35:48,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 699 transitions. [2023-08-24 05:35:48,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:48,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 699 transitions. [2023-08-24 05:35:48,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 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-08-24 05:35:48,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-08-24 05:35:48,502 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-08-24 05:35:48,503 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 5 states and 699 transitions. [2023-08-24 05:35:48,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 67 transitions, 285 flow [2023-08-24 05:35:48,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 67 transitions, 278 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 05:35:48,507 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 72 flow [2023-08-24 05:35:48,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-08-24 05:35:48,511 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-24 05:35:48,512 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 72 flow [2023-08-24 05:35:48,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 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-08-24 05:35:48,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:48,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:48,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:35:48,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:35:48,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1429469581, now seen corresponding path program 1 times [2023-08-24 05:35:48,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:48,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465402648] [2023-08-24 05:35:48,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:48,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:35:48,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:48,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465402648] [2023-08-24 05:35:48,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465402648] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:48,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:48,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:35:48,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199762320] [2023-08-24 05:35:48,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:48,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:35:48,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:48,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:35:48,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:35:48,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 247 [2023-08-24 05:35:48,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 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-08-24 05:35:48,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:48,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 247 [2023-08-24 05:35:48,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:49,792 INFO L124 PetriNetUnfolderBase]: 6827/9622 cut-off events. [2023-08-24 05:35:49,792 INFO L125 PetriNetUnfolderBase]: For 1105/1105 co-relation queries the response was YES. [2023-08-24 05:35:49,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20751 conditions, 9622 events. 6827/9622 cut-off events. For 1105/1105 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 50340 event pairs, 919 based on Foata normal form. 240/9861 useless extension candidates. Maximal degree in co-relation 20738. Up to 4477 conditions per place. [2023-08-24 05:35:49,832 INFO L140 encePairwiseOnDemand]: 241/247 looper letters, 45 selfloop transitions, 4 changer transitions 27/77 dead transitions. [2023-08-24 05:35:49,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 77 transitions, 337 flow [2023-08-24 05:35:49,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:35:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:35:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 816 transitions. [2023-08-24 05:35:49,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506072874493927 [2023-08-24 05:35:49,834 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 816 transitions. [2023-08-24 05:35:49,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 816 transitions. [2023-08-24 05:35:49,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:49,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 816 transitions. [2023-08-24 05:35:49,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 0 states have call successors, (0), 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-08-24 05:35:49,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 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-08-24 05:35:49,840 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 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-08-24 05:35:49,840 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 72 flow. Second operand 6 states and 816 transitions. [2023-08-24 05:35:49,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 77 transitions, 337 flow [2023-08-24 05:35:49,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 77 transitions, 327 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-24 05:35:49,879 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 98 flow [2023-08-24 05:35:49,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2023-08-24 05:35:49,882 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-24 05:35:49,886 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 98 flow [2023-08-24 05:35:49,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 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-08-24 05:35:49,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:49,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:49,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:35:49,887 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:35:49,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:49,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1363142922, now seen corresponding path program 1 times [2023-08-24 05:35:49,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:49,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109802399] [2023-08-24 05:35:49,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:49,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:35:50,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:50,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109802399] [2023-08-24 05:35:50,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109802399] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:50,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:50,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:35:50,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802669542] [2023-08-24 05:35:50,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:50,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:35:50,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:50,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:35:50,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:35:50,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 247 [2023-08-24 05:35:50,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 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-08-24 05:35:50,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:50,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 247 [2023-08-24 05:35:50,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:50,907 INFO L124 PetriNetUnfolderBase]: 3804/5447 cut-off events. [2023-08-24 05:35:50,907 INFO L125 PetriNetUnfolderBase]: For 2692/2692 co-relation queries the response was YES. [2023-08-24 05:35:50,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13299 conditions, 5447 events. 3804/5447 cut-off events. For 2692/2692 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26714 event pairs, 1674 based on Foata normal form. 180/5599 useless extension candidates. Maximal degree in co-relation 13284. Up to 4279 conditions per place. [2023-08-24 05:35:50,964 INFO L140 encePairwiseOnDemand]: 243/247 looper letters, 36 selfloop transitions, 2 changer transitions 18/59 dead transitions. [2023-08-24 05:35:50,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 288 flow [2023-08-24 05:35:50,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:35:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:35:50,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 687 transitions. [2023-08-24 05:35:50,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5562753036437247 [2023-08-24 05:35:50,967 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 687 transitions. [2023-08-24 05:35:50,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 687 transitions. [2023-08-24 05:35:50,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:50,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 687 transitions. [2023-08-24 05:35:50,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 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-08-24 05:35:50,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-08-24 05:35:50,971 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-08-24 05:35:50,972 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 98 flow. Second operand 5 states and 687 transitions. [2023-08-24 05:35:50,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 288 flow [2023-08-24 05:35:50,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 271 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-24 05:35:50,990 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 99 flow [2023-08-24 05:35:50,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-08-24 05:35:50,991 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-24 05:35:50,993 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 99 flow [2023-08-24 05:35:50,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 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-08-24 05:35:50,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:50,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:50,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:35:50,994 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:35:50,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash -669061334, now seen corresponding path program 1 times [2023-08-24 05:35:50,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:50,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180632380] [2023-08-24 05:35:50,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:50,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:35:51,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:51,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180632380] [2023-08-24 05:35:51,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180632380] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:51,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:51,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:35:51,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901789785] [2023-08-24 05:35:51,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:51,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:35:51,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:51,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:35:51,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:35:51,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 247 [2023-08-24 05:35:51,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 28 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 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-08-24 05:35:51,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:51,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 247 [2023-08-24 05:35:51,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:52,369 INFO L124 PetriNetUnfolderBase]: 7555/10718 cut-off events. [2023-08-24 05:35:52,370 INFO L125 PetriNetUnfolderBase]: For 5653/5653 co-relation queries the response was YES. [2023-08-24 05:35:52,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25186 conditions, 10718 events. 7555/10718 cut-off events. For 5653/5653 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 59495 event pairs, 2173 based on Foata normal form. 360/11018 useless extension candidates. Maximal degree in co-relation 25170. Up to 3665 conditions per place. [2023-08-24 05:35:52,396 INFO L140 encePairwiseOnDemand]: 242/247 looper letters, 38 selfloop transitions, 3 changer transitions 57/99 dead transitions. [2023-08-24 05:35:52,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 99 transitions, 474 flow [2023-08-24 05:35:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:35:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:35:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1084 transitions. [2023-08-24 05:35:52,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.548582995951417 [2023-08-24 05:35:52,399 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1084 transitions. [2023-08-24 05:35:52,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1084 transitions. [2023-08-24 05:35:52,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:52,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1084 transitions. [2023-08-24 05:35:52,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 135.5) internal successors, (1084), 8 states have internal predecessors, (1084), 0 states have call successors, (0), 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-08-24 05:35:52,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 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-08-24 05:35:52,404 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 247.0) internal successors, (2223), 9 states have internal predecessors, (2223), 0 states have call successors, (0), 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-08-24 05:35:52,404 INFO L175 Difference]: Start difference. First operand has 46 places, 28 transitions, 99 flow. Second operand 8 states and 1084 transitions. [2023-08-24 05:35:52,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 99 transitions, 474 flow [2023-08-24 05:35:52,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 99 transitions, 456 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-24 05:35:52,430 INFO L231 Difference]: Finished difference. Result has 53 places, 28 transitions, 112 flow [2023-08-24 05:35:52,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=112, PETRI_PLACES=53, PETRI_TRANSITIONS=28} [2023-08-24 05:35:52,431 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2023-08-24 05:35:52,431 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 28 transitions, 112 flow [2023-08-24 05:35:52,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 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-08-24 05:35:52,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:52,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:52,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:35:52,431 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:35:52,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:52,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1351935804, now seen corresponding path program 1 times [2023-08-24 05:35:52,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:52,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966578633] [2023-08-24 05:35:52,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:52,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:35:53,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:53,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966578633] [2023-08-24 05:35:53,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966578633] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:53,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:53,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:35:53,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566092174] [2023-08-24 05:35:53,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:53,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:35:53,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:53,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:35:53,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:35:53,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 247 [2023-08-24 05:35:53,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 28 transitions, 112 flow. Second operand has 8 states, 8 states have (on average 102.875) internal successors, (823), 8 states have internal predecessors, (823), 0 states have call successors, (0), 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-08-24 05:35:53,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:53,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 247 [2023-08-24 05:35:53,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:54,331 INFO L124 PetriNetUnfolderBase]: 5546/7849 cut-off events. [2023-08-24 05:35:54,331 INFO L125 PetriNetUnfolderBase]: For 10928/10992 co-relation queries the response was YES. [2023-08-24 05:35:54,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19139 conditions, 7849 events. 5546/7849 cut-off events. For 10928/10992 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 39452 event pairs, 3395 based on Foata normal form. 305/8148 useless extension candidates. Maximal degree in co-relation 19120. Up to 6805 conditions per place. [2023-08-24 05:35:54,349 INFO L140 encePairwiseOnDemand]: 241/247 looper letters, 37 selfloop transitions, 4 changer transitions 16/59 dead transitions. [2023-08-24 05:35:54,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 316 flow [2023-08-24 05:35:54,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:35:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:35:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2023-08-24 05:35:54,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45506072874493925 [2023-08-24 05:35:54,352 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 562 transitions. [2023-08-24 05:35:54,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 562 transitions. [2023-08-24 05:35:54,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:54,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 562 transitions. [2023-08-24 05:35:54,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 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-08-24 05:35:54,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-08-24 05:35:54,355 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-08-24 05:35:54,355 INFO L175 Difference]: Start difference. First operand has 53 places, 28 transitions, 112 flow. Second operand 5 states and 562 transitions. [2023-08-24 05:35:54,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 316 flow [2023-08-24 05:35:54,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 294 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-08-24 05:35:54,364 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 133 flow [2023-08-24 05:35:54,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2023-08-24 05:35:54,365 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-08-24 05:35:54,365 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 133 flow [2023-08-24 05:35:54,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.875) internal successors, (823), 8 states have internal predecessors, (823), 0 states have call successors, (0), 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-08-24 05:35:54,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:54,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:54,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:35:54,365 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:35:54,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1039638813, now seen corresponding path program 1 times [2023-08-24 05:35:54,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:54,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978079936] [2023-08-24 05:35:54,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:54,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:35:54,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:54,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978079936] [2023-08-24 05:35:54,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978079936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:54,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:54,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:35:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437154401] [2023-08-24 05:35:54,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:54,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:35:54,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:54,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:35:54,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:35:54,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 247 [2023-08-24 05:35:54,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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-08-24 05:35:54,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:54,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 247 [2023-08-24 05:35:54,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:54,963 INFO L124 PetriNetUnfolderBase]: 3233/4752 cut-off events. [2023-08-24 05:35:54,963 INFO L125 PetriNetUnfolderBase]: For 5233/5386 co-relation queries the response was YES. [2023-08-24 05:35:54,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13317 conditions, 4752 events. 3233/4752 cut-off events. For 5233/5386 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 24446 event pairs, 862 based on Foata normal form. 106/4734 useless extension candidates. Maximal degree in co-relation 13299. Up to 4259 conditions per place. [2023-08-24 05:35:54,974 INFO L140 encePairwiseOnDemand]: 241/247 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-08-24 05:35:54,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 290 flow [2023-08-24 05:35:54,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:35:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:35:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-24 05:35:54,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5573549257759784 [2023-08-24 05:35:54,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-24 05:35:54,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-24 05:35:54,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:54,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-24 05:35:54,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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-08-24 05:35:54,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 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-08-24 05:35:54,978 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 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-08-24 05:35:54,978 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 133 flow. Second operand 3 states and 413 transitions. [2023-08-24 05:35:54,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 290 flow [2023-08-24 05:35:54,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 282 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 05:35:54,984 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 160 flow [2023-08-24 05:35:54,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-24 05:35:54,984 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-08-24 05:35:54,984 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 160 flow [2023-08-24 05:35:54,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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-08-24 05:35:54,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:54,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:54,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:35:54,985 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:35:54,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:54,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1577076348, now seen corresponding path program 1 times [2023-08-24 05:35:54,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:54,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292210738] [2023-08-24 05:35:54,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:54,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:35:56,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:56,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292210738] [2023-08-24 05:35:56,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292210738] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:56,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:56,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 05:35:56,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362634839] [2023-08-24 05:35:56,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:56,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 05:35:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:56,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 05:35:56,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-24 05:35:56,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 247 [2023-08-24 05:35:56,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 160 flow. Second operand has 9 states, 9 states have (on average 100.88888888888889) internal successors, (908), 9 states have internal predecessors, (908), 0 states have call successors, (0), 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-08-24 05:35:56,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:56,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 247 [2023-08-24 05:35:56,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:56,860 INFO L124 PetriNetUnfolderBase]: 3428/5077 cut-off events. [2023-08-24 05:35:56,860 INFO L125 PetriNetUnfolderBase]: For 5919/5960 co-relation queries the response was YES. [2023-08-24 05:35:56,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15986 conditions, 5077 events. 3428/5077 cut-off events. For 5919/5960 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 25805 event pairs, 1757 based on Foata normal form. 123/5198 useless extension candidates. Maximal degree in co-relation 15967. Up to 4562 conditions per place. [2023-08-24 05:35:56,886 INFO L140 encePairwiseOnDemand]: 242/247 looper letters, 45 selfloop transitions, 5 changer transitions 15/67 dead transitions. [2023-08-24 05:35:56,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 425 flow [2023-08-24 05:35:56,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:35:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:35:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2023-08-24 05:35:56,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44696356275303645 [2023-08-24 05:35:56,888 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2023-08-24 05:35:56,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2023-08-24 05:35:56,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:56,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2023-08-24 05:35:56,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 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-08-24 05:35:56,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-08-24 05:35:56,891 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-08-24 05:35:56,891 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 160 flow. Second operand 5 states and 552 transitions. [2023-08-24 05:35:56,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 425 flow [2023-08-24 05:35:56,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:35:56,896 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 196 flow [2023-08-24 05:35:56,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2023-08-24 05:35:56,897 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-08-24 05:35:56,897 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 196 flow [2023-08-24 05:35:56,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 100.88888888888889) internal successors, (908), 9 states have internal predecessors, (908), 0 states have call successors, (0), 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-08-24 05:35:56,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:56,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:56,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:35:56,897 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:35:56,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash 303431936, now seen corresponding path program 1 times [2023-08-24 05:35:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:56,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475276632] [2023-08-24 05:35:56,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:56,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:35:57,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:57,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475276632] [2023-08-24 05:35:57,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475276632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:57,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:57,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:35:57,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107785946] [2023-08-24 05:35:57,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:57,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:35:57,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:57,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:35:57,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:35:57,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 247 [2023-08-24 05:35:57,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 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-08-24 05:35:57,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:57,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 247 [2023-08-24 05:35:57,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:57,377 INFO L124 PetriNetUnfolderBase]: 1495/2385 cut-off events. [2023-08-24 05:35:57,377 INFO L125 PetriNetUnfolderBase]: For 4153/4251 co-relation queries the response was YES. [2023-08-24 05:35:57,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7988 conditions, 2385 events. 1495/2385 cut-off events. For 4153/4251 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12027 event pairs, 282 based on Foata normal form. 178/2520 useless extension candidates. Maximal degree in co-relation 7965. Up to 1466 conditions per place. [2023-08-24 05:35:57,383 INFO L140 encePairwiseOnDemand]: 241/247 looper letters, 54 selfloop transitions, 9 changer transitions 0/68 dead transitions. [2023-08-24 05:35:57,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 458 flow [2023-08-24 05:35:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:35:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:35:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-24 05:35:57,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2023-08-24 05:35:57,385 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-24 05:35:57,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-24 05:35:57,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:57,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-24 05:35:57,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 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-08-24 05:35:57,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 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-08-24 05:35:57,387 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 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-08-24 05:35:57,387 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 196 flow. Second operand 4 states and 551 transitions. [2023-08-24 05:35:57,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 458 flow [2023-08-24 05:35:57,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 430 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-24 05:35:57,391 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 231 flow [2023-08-24 05:35:57,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-24 05:35:57,393 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2023-08-24 05:35:57,393 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 231 flow [2023-08-24 05:35:57,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 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-08-24 05:35:57,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:57,393 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] [2023-08-24 05:35:57,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:35:57,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:35:57,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:57,396 INFO L85 PathProgramCache]: Analyzing trace with hash 440507260, now seen corresponding path program 1 times [2023-08-24 05:35:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:57,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854517421] [2023-08-24 05:35:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:57,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:35:57,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:57,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854517421] [2023-08-24 05:35:57,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854517421] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:57,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:57,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:35:57,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277496141] [2023-08-24 05:35:57,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:57,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:35:57,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:57,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:35:57,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:35:57,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 247 [2023-08-24 05:35:57,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 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-08-24 05:35:57,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:57,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 247 [2023-08-24 05:35:57,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:57,787 INFO L124 PetriNetUnfolderBase]: 886/1447 cut-off events. [2023-08-24 05:35:57,787 INFO L125 PetriNetUnfolderBase]: For 2166/2200 co-relation queries the response was YES. [2023-08-24 05:35:57,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5174 conditions, 1447 events. 886/1447 cut-off events. For 2166/2200 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6801 event pairs, 163 based on Foata normal form. 102/1520 useless extension candidates. Maximal degree in co-relation 5151. Up to 520 conditions per place. [2023-08-24 05:35:57,792 INFO L140 encePairwiseOnDemand]: 241/247 looper letters, 61 selfloop transitions, 13 changer transitions 0/79 dead transitions. [2023-08-24 05:35:57,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 79 transitions, 540 flow [2023-08-24 05:35:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:35:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:35:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2023-08-24 05:35:57,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5554655870445344 [2023-08-24 05:35:57,794 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2023-08-24 05:35:57,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2023-08-24 05:35:57,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:57,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2023-08-24 05:35:57,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 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-08-24 05:35:57,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-08-24 05:35:57,798 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-08-24 05:35:57,798 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 231 flow. Second operand 5 states and 686 transitions. [2023-08-24 05:35:57,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 79 transitions, 540 flow [2023-08-24 05:35:57,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 522 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 05:35:57,801 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 281 flow [2023-08-24 05:35:57,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-24 05:35:57,802 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2023-08-24 05:35:57,802 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 281 flow [2023-08-24 05:35:57,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 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-08-24 05:35:57,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:57,803 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-08-24 05:35:57,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:35:57,803 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:35:57,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:57,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1538005465, now seen corresponding path program 1 times [2023-08-24 05:35:57,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:57,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860677189] [2023-08-24 05:35:57,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:57,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:35:57,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:57,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860677189] [2023-08-24 05:35:57,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860677189] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:57,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:57,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:35:57,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148351150] [2023-08-24 05:35:57,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:57,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:35:57,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:57,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:35:57,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:35:57,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 247 [2023-08-24 05:35:57,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 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-08-24 05:35:57,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:57,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 247 [2023-08-24 05:35:57,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:58,188 INFO L124 PetriNetUnfolderBase]: 818/1305 cut-off events. [2023-08-24 05:35:58,188 INFO L125 PetriNetUnfolderBase]: For 2146/2177 co-relation queries the response was YES. [2023-08-24 05:35:58,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4765 conditions, 1305 events. 818/1305 cut-off events. For 2146/2177 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6059 event pairs, 152 based on Foata normal form. 27/1304 useless extension candidates. Maximal degree in co-relation 4741. Up to 520 conditions per place. [2023-08-24 05:35:58,192 INFO L140 encePairwiseOnDemand]: 241/247 looper letters, 53 selfloop transitions, 17 changer transitions 5/79 dead transitions. [2023-08-24 05:35:58,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 566 flow [2023-08-24 05:35:58,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:35:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:35:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 810 transitions. [2023-08-24 05:35:58,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5465587044534413 [2023-08-24 05:35:58,193 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 810 transitions. [2023-08-24 05:35:58,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 810 transitions. [2023-08-24 05:35:58,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:58,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 810 transitions. [2023-08-24 05:35:58,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 0 states have call successors, (0), 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-08-24 05:35:58,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 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-08-24 05:35:58,197 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 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-08-24 05:35:58,197 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 281 flow. Second operand 6 states and 810 transitions. [2023-08-24 05:35:58,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 566 flow [2023-08-24 05:35:58,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 506 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-08-24 05:35:58,204 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 260 flow [2023-08-24 05:35:58,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2023-08-24 05:35:58,205 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2023-08-24 05:35:58,205 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 260 flow [2023-08-24 05:35:58,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 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-08-24 05:35:58,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:58,205 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-08-24 05:35:58,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:35:58,205 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:35:58,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:58,206 INFO L85 PathProgramCache]: Analyzing trace with hash 149909468, now seen corresponding path program 1 times [2023-08-24 05:35:58,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:58,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267749367] [2023-08-24 05:35:58,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:58,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:35:59,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:59,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267749367] [2023-08-24 05:35:59,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267749367] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:59,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:59,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:35:59,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365073642] [2023-08-24 05:35:59,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:59,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:35:59,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:59,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:35:59,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:35:59,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 247 [2023-08-24 05:35:59,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 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-08-24 05:35:59,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:59,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 247 [2023-08-24 05:35:59,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:59,287 INFO L124 PetriNetUnfolderBase]: 595/954 cut-off events. [2023-08-24 05:35:59,287 INFO L125 PetriNetUnfolderBase]: For 2037/2041 co-relation queries the response was YES. [2023-08-24 05:35:59,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3577 conditions, 954 events. 595/954 cut-off events. For 2037/2041 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3802 event pairs, 218 based on Foata normal form. 1/951 useless extension candidates. Maximal degree in co-relation 3555. Up to 736 conditions per place. [2023-08-24 05:35:59,290 INFO L140 encePairwiseOnDemand]: 239/247 looper letters, 51 selfloop transitions, 8 changer transitions 7/67 dead transitions. [2023-08-24 05:35:59,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 564 flow [2023-08-24 05:35:59,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:35:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:35:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2023-08-24 05:35:59,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4842105263157895 [2023-08-24 05:35:59,292 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 598 transitions. [2023-08-24 05:35:59,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 598 transitions. [2023-08-24 05:35:59,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:59,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 598 transitions. [2023-08-24 05:35:59,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 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-08-24 05:35:59,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-08-24 05:35:59,294 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-08-24 05:35:59,294 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 260 flow. Second operand 5 states and 598 transitions. [2023-08-24 05:35:59,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 564 flow [2023-08-24 05:35:59,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 448 flow, removed 31 selfloop flow, removed 7 redundant places. [2023-08-24 05:35:59,298 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 247 flow [2023-08-24 05:35:59,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-24 05:35:59,299 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2023-08-24 05:35:59,299 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 247 flow [2023-08-24 05:35:59,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 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-08-24 05:35:59,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:59,299 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-08-24 05:35:59,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:35:59,300 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:35:59,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:59,300 INFO L85 PathProgramCache]: Analyzing trace with hash -278447510, now seen corresponding path program 2 times [2023-08-24 05:35:59,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:59,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894862315] [2023-08-24 05:35:59,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:59,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:36:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:36:00,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:36:00,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894862315] [2023-08-24 05:36:00,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894862315] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:36:00,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:36:00,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:36:00,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277668053] [2023-08-24 05:36:00,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:36:00,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:36:00,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:36:00,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:36:00,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:36:00,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 247 [2023-08-24 05:36:00,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 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-08-24 05:36:00,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:36:00,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 247 [2023-08-24 05:36:00,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:36:00,309 INFO L124 PetriNetUnfolderBase]: 722/1161 cut-off events. [2023-08-24 05:36:00,309 INFO L125 PetriNetUnfolderBase]: For 1875/1879 co-relation queries the response was YES. [2023-08-24 05:36:00,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 1161 events. 722/1161 cut-off events. For 1875/1879 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4817 event pairs, 247 based on Foata normal form. 1/1158 useless extension candidates. Maximal degree in co-relation 4279. Up to 589 conditions per place. [2023-08-24 05:36:00,313 INFO L140 encePairwiseOnDemand]: 237/247 looper letters, 52 selfloop transitions, 10 changer transitions 21/84 dead transitions. [2023-08-24 05:36:00,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 84 transitions, 615 flow [2023-08-24 05:36:00,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:36:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:36:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions. [2023-08-24 05:36:00,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006747638326585 [2023-08-24 05:36:00,315 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 742 transitions. [2023-08-24 05:36:00,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions. [2023-08-24 05:36:00,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:36:00,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions. [2023-08-24 05:36:00,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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-08-24 05:36:00,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 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-08-24 05:36:00,318 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 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-08-24 05:36:00,318 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 247 flow. Second operand 6 states and 742 transitions. [2023-08-24 05:36:00,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 84 transitions, 615 flow [2023-08-24 05:36:00,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 588 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-24 05:36:00,327 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 263 flow [2023-08-24 05:36:00,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-08-24 05:36:00,327 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-08-24 05:36:00,327 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 263 flow [2023-08-24 05:36:00,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 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-08-24 05:36:00,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:36:00,328 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-08-24 05:36:00,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:36:00,328 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:36:00,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:36:00,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1983957100, now seen corresponding path program 3 times [2023-08-24 05:36:00,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:36:00,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648965709] [2023-08-24 05:36:00,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:36:00,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:36:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:36:00,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:36:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:36:00,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:36:00,542 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:36:00,543 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-24 05:36:00,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-08-24 05:36:00,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-24 05:36:00,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-24 05:36:00,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-08-24 05:36:00,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:36:00,547 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:36:00,550 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:36:00,550 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:36:00,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:36:00 BasicIcfg [2023-08-24 05:36:00,634 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:36:00,634 INFO L158 Benchmark]: Toolchain (without parser) took 19639.59ms. Allocated memory was 325.1MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 300.0MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 76.4MB. Max. memory is 16.0GB. [2023-08-24 05:36:00,634 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 325.1MB. Free memory is still 301.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:36:00,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.75ms. Allocated memory is still 325.1MB. Free memory was 300.0MB in the beginning and 274.5MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-24 05:36:00,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.54ms. Allocated memory is still 325.1MB. Free memory was 274.5MB in the beginning and 271.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:36:00,634 INFO L158 Benchmark]: Boogie Preprocessor took 28.47ms. Allocated memory is still 325.1MB. Free memory was 271.7MB in the beginning and 268.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 05:36:00,635 INFO L158 Benchmark]: RCFGBuilder took 715.70ms. Allocated memory is still 325.1MB. Free memory was 268.9MB in the beginning and 233.3MB in the end (delta: 35.6MB). Peak memory consumption was 35.9MB. Max. memory is 16.0GB. [2023-08-24 05:36:00,635 INFO L158 Benchmark]: TraceAbstraction took 18404.93ms. Allocated memory was 325.1MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 232.5MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. [2023-08-24 05:36:00,636 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 325.1MB. Free memory is still 301.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 447.75ms. Allocated memory is still 325.1MB. Free memory was 300.0MB in the beginning and 274.5MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.54ms. Allocated memory is still 325.1MB. Free memory was 274.5MB in the beginning and 271.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.47ms. Allocated memory is still 325.1MB. Free memory was 271.7MB in the beginning and 268.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 715.70ms. Allocated memory is still 325.1MB. Free memory was 268.9MB in the beginning and 233.3MB in the end (delta: 35.6MB). Peak memory consumption was 35.9MB. Max. memory is 16.0GB. * TraceAbstraction took 18404.93ms. Allocated memory was 325.1MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 232.5MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 138 PlacesBefore, 40 PlacesAfterwards, 126 TransitionsBefore, 28 TransitionsAfterwards, 1950 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 103 TotalNumberOfCompositions, 6399 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2214, independent: 1957, independent conditional: 0, independent unconditional: 1957, dependent: 257, dependent conditional: 0, dependent unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 984, independent: 944, independent conditional: 0, independent unconditional: 944, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2214, independent: 1013, independent conditional: 0, independent unconditional: 1013, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 984, unknown conditional: 0, unknown unconditional: 984] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff0_thd4; [L744] 0 _Bool x$r_buff1_thd0; [L745] 0 _Bool x$r_buff1_thd1; [L746] 0 _Bool x$r_buff1_thd2; [L747] 0 _Bool x$r_buff1_thd3; [L748] 0 _Bool x$r_buff1_thd4; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2165; [L861] FCALL, FORK 0 pthread_create(&t2165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2165, ((void *)0), P0, ((void *)0))=-3, t2165={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L862] 0 pthread_t t2166; [L863] FCALL, FORK 0 pthread_create(&t2166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2166, ((void *)0), P1, ((void *)0))=-2, t2165={7:0}, t2166={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L864] 0 pthread_t t2167; [L865] FCALL, FORK 0 pthread_create(&t2167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2167, ((void *)0), P2, ((void *)0))=-1, t2165={7:0}, t2166={8:0}, t2167={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L866] 0 pthread_t t2168; [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 x$flush_delayed = weak$$choice2 [L803] EXPR 3 \read(x) [L803] 3 x$mem_tmp = x [L804] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L804] EXPR 3 \read(x) [L804] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L804] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L805] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L806] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L807] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L808] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L810] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L812] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L813] EXPR 3 \read(x) [L813] 3 __unbuffered_p2_EAX = x [L814] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L814] 3 x = x$flush_delayed ? x$mem_tmp : x [L815] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L818] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L821] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L821] EXPR 3 \read(x) [L821] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L821] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L822] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L823] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L824] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L825] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L867] FCALL, FORK 0 pthread_create(&t2168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2168, ((void *)0), P3, ((void *)0))=0, t2165={7:0}, t2166={8:0}, t2167={9:0}, t2168={5:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L835] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L838] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L838] EXPR 4 \read(x) [L838] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L838] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L839] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L840] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L841] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L842] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L766] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L783] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 \read(x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 \read(x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L770] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L771] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L772] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L773] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L871] RET 0 assume_abort_if_not(main$tmp_guard0) [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L873] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L873] EXPR 0 \read(x) [L873] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L873] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L874] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L875] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L876] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L877] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2165={7:0}, t2166={8:0}, t2167={9:0}, t2168={5:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L880] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L881] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L882] 0 x$flush_delayed = weak$$choice2 [L883] EXPR 0 \read(x) [L883] 0 x$mem_tmp = x [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L884] EXPR 0 \read(x) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L884] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L885] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L886] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L887] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L888] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L890] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L891] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] EXPR 0 \read(x) [L893] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L894] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L894] 0 x = x$flush_delayed ? x$mem_tmp : x [L895] 0 x$flush_delayed = (_Bool)0 [L897] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1253 IncrementalHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 5 mSDtfsCounter, 1253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=9, InterpolantAutomatonStates: 63, 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, 5.1s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 2466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-08-24 05:36:00,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...