/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:48:44,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:48:44,444 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-NoLbe.epf [2023-11-10 11:48:44,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:48:44,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:48:44,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:48:44,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:48:44,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:48:44,479 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:48:44,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:48:44,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:48:44,483 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:48:44,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:48:44,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:48:44,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:48:44,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:48:44,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:48:44,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:48:44,486 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:48:44,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:48:44,486 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:48:44,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:48:44,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:48:44,487 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:48:44,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:48:44,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:48:44,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:48:44,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:48:44,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:48:44,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:48:44,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:48:44,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:48:44,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:48:44,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-10 11:48:44,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:48:44,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:48:44,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:48:44,740 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:48:44,741 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:48:44,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2023-11-10 11:48:45,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:48:46,234 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:48:46,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2023-11-10 11:48:46,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ff1aec33/113968be6efb4fc3b74663f3b375299e/FLAG685306cfd [2023-11-10 11:48:46,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ff1aec33/113968be6efb4fc3b74663f3b375299e [2023-11-10 11:48:46,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:48:46,291 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:48:46,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:48:46,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:48:46,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:48:46,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:48:46" (1/1) ... [2023-11-10 11:48:46,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca6acc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:46, skipping insertion in model container [2023-11-10 11:48:46,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:48:46" (1/1) ... [2023-11-10 11:48:46,362 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:48:46,880 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i[76084,76097] [2023-11-10 11:48:46,928 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:48:46,938 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:48:46,996 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i[76084,76097] [2023-11-10 11:48:47,026 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:48:47,108 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:48:47,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:47 WrapperNode [2023-11-10 11:48:47,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:48:47,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:48:47,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:48:47,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:48:47,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:47" (1/1) ... [2023-11-10 11:48:47,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:47" (1/1) ... [2023-11-10 11:48:47,168 INFO L138 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 135 [2023-11-10 11:48:47,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:48:47,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:48:47,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:48:47,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:48:47,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:47" (1/1) ... [2023-11-10 11:48:47,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:47" (1/1) ... [2023-11-10 11:48:47,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:47" (1/1) ... [2023-11-10 11:48:47,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:47" (1/1) ... [2023-11-10 11:48:47,212 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:47" (1/1) ... [2023-11-10 11:48:47,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:47" (1/1) ... [2023-11-10 11:48:47,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:47" (1/1) ... [2023-11-10 11:48:47,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:47" (1/1) ... [2023-11-10 11:48:47,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:48:47,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:48:47,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:48:47,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:48:47,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:47" (1/1) ... [2023-11-10 11:48:47,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:48:47,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:48:47,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-10 11:48:47,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-10 11:48:47,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:48:47,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-10 11:48:47,313 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-10 11:48:47,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:48:47,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-10 11:48:47,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:48:47,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:48:47,314 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-11-10 11:48:47,314 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-11-10 11:48:47,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:48:47,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:48:47,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:48:47,316 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 11:48:47,616 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:48:47,618 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:48:47,873 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:48:47,887 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:48:47,887 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-10 11:48:47,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:48:47 BoogieIcfgContainer [2023-11-10 11:48:47,891 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:48:47,893 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:48:47,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:48:47,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:48:47,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:48:46" (1/3) ... [2023-11-10 11:48:47,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258e033d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:48:47, skipping insertion in model container [2023-11-10 11:48:47,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:47" (2/3) ... [2023-11-10 11:48:47,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258e033d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:48:47, skipping insertion in model container [2023-11-10 11:48:47,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:48:47" (3/3) ... [2023-11-10 11:48:47,899 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2023-11-10 11:48:47,914 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:48:47,914 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-10 11:48:47,914 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:48:47,986 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-10 11:48:48,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 196 transitions, 406 flow [2023-11-10 11:48:48,104 INFO L124 PetriNetUnfolderBase]: 10/242 cut-off events. [2023-11-10 11:48:48,105 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-10 11:48:48,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 242 events. 10/242 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 431 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 139. Up to 4 conditions per place. [2023-11-10 11:48:48,112 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 196 transitions, 406 flow [2023-11-10 11:48:48,125 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 180 transitions, 372 flow [2023-11-10 11:48:48,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:48:48,141 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68b66205, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:48:48,142 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-10 11:48:48,153 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:48:48,154 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2023-11-10 11:48:48,154 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:48:48,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:48,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:48,155 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:48:48,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash -570244518, now seen corresponding path program 1 times [2023-11-10 11:48:48,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:48,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200207264] [2023-11-10 11:48:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:48,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:48,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:48,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200207264] [2023-11-10 11:48:48,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200207264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:48,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:48,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:48:48,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688384870] [2023-11-10 11:48:48,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:48,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:48:48,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:48,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:48:48,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:48:48,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 196 [2023-11-10 11:48:48,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 180 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:48,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:48,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 196 [2023-11-10 11:48:48,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:49,365 INFO L124 PetriNetUnfolderBase]: 433/1326 cut-off events. [2023-11-10 11:48:49,365 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-10 11:48:49,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2147 conditions, 1326 events. 433/1326 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8977 event pairs, 408 based on Foata normal form. 20/1284 useless extension candidates. Maximal degree in co-relation 1897. Up to 741 conditions per place. [2023-11-10 11:48:49,380 INFO L140 encePairwiseOnDemand]: 174/196 looper letters, 64 selfloop transitions, 17 changer transitions 0/175 dead transitions. [2023-11-10 11:48:49,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 175 transitions, 524 flow [2023-11-10 11:48:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-10 11:48:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-10 11:48:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 934 transitions. [2023-11-10 11:48:49,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5956632653061225 [2023-11-10 11:48:49,414 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 934 transitions. [2023-11-10 11:48:49,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 934 transitions. [2023-11-10 11:48:49,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:49,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 934 transitions. [2023-11-10 11:48:49,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.75) internal successors, (934), 8 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:49,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:49,436 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:49,438 INFO L175 Difference]: Start difference. First operand has 180 places, 180 transitions, 372 flow. Second operand 8 states and 934 transitions. [2023-11-10 11:48:49,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 175 transitions, 524 flow [2023-11-10 11:48:49,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 175 transitions, 516 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-10 11:48:49,448 INFO L231 Difference]: Finished difference. Result has 177 places, 169 transitions, 385 flow [2023-11-10 11:48:49,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=385, PETRI_PLACES=177, PETRI_TRANSITIONS=169} [2023-11-10 11:48:49,455 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, -3 predicate places. [2023-11-10 11:48:49,456 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 169 transitions, 385 flow [2023-11-10 11:48:49,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:49,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:49,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:49,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:48:49,458 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:48:49,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:49,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1664752726, now seen corresponding path program 1 times [2023-11-10 11:48:49,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:49,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112332177] [2023-11-10 11:48:49,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:49,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:49,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:49,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112332177] [2023-11-10 11:48:49,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112332177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:49,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:49,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:48:49,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762148720] [2023-11-10 11:48:49,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:49,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:48:49,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:49,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:48:49,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:48:49,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 196 [2023-11-10 11:48:49,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 169 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:49,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:49,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 196 [2023-11-10 11:48:49,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:50,051 INFO L124 PetriNetUnfolderBase]: 433/1324 cut-off events. [2023-11-10 11:48:50,051 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-10 11:48:50,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 1324 events. 433/1324 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8967 event pairs, 408 based on Foata normal form. 1/1283 useless extension candidates. Maximal degree in co-relation 1235. Up to 742 conditions per place. [2023-11-10 11:48:50,063 INFO L140 encePairwiseOnDemand]: 178/196 looper letters, 63 selfloop transitions, 17 changer transitions 0/173 dead transitions. [2023-11-10 11:48:50,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 173 transitions, 553 flow [2023-11-10 11:48:50,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-10 11:48:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-10 11:48:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 929 transitions. [2023-11-10 11:48:50,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5924744897959183 [2023-11-10 11:48:50,066 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 929 transitions. [2023-11-10 11:48:50,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 929 transitions. [2023-11-10 11:48:50,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:50,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 929 transitions. [2023-11-10 11:48:50,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:50,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:50,074 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:50,074 INFO L175 Difference]: Start difference. First operand has 177 places, 169 transitions, 385 flow. Second operand 8 states and 929 transitions. [2023-11-10 11:48:50,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 173 transitions, 553 flow [2023-11-10 11:48:50,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 173 transitions, 526 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-10 11:48:50,082 INFO L231 Difference]: Finished difference. Result has 176 places, 167 transitions, 388 flow [2023-11-10 11:48:50,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=388, PETRI_PLACES=176, PETRI_TRANSITIONS=167} [2023-11-10 11:48:50,083 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, -4 predicate places. [2023-11-10 11:48:50,083 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 167 transitions, 388 flow [2023-11-10 11:48:50,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:50,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:50,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:50,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:48:50,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:48:50,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1279321180, now seen corresponding path program 1 times [2023-11-10 11:48:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:50,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390159556] [2023-11-10 11:48:50,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:50,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:50,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:50,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390159556] [2023-11-10 11:48:50,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390159556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:50,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:50,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:48:50,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7541708] [2023-11-10 11:48:50,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:50,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:48:50,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:50,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:48:50,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:48:50,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 196 [2023-11-10 11:48:50,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 167 transitions, 388 flow. Second operand has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:50,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:50,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 196 [2023-11-10 11:48:50,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:50,968 INFO L124 PetriNetUnfolderBase]: 924/2203 cut-off events. [2023-11-10 11:48:50,968 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-10 11:48:50,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3965 conditions, 2203 events. 924/2203 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14826 event pairs, 242 based on Foata normal form. 32/2216 useless extension candidates. Maximal degree in co-relation 2592. Up to 864 conditions per place. [2023-11-10 11:48:50,982 INFO L140 encePairwiseOnDemand]: 175/196 looper letters, 103 selfloop transitions, 38 changer transitions 0/236 dead transitions. [2023-11-10 11:48:50,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 236 transitions, 816 flow [2023-11-10 11:48:50,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:48:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:48:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1173 transitions. [2023-11-10 11:48:50,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5984693877551021 [2023-11-10 11:48:50,986 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1173 transitions. [2023-11-10 11:48:50,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1173 transitions. [2023-11-10 11:48:50,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:50,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1173 transitions. [2023-11-10 11:48:50,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.3) internal successors, (1173), 10 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:50,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:50,995 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:50,995 INFO L175 Difference]: Start difference. First operand has 176 places, 167 transitions, 388 flow. Second operand 10 states and 1173 transitions. [2023-11-10 11:48:50,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 236 transitions, 816 flow [2023-11-10 11:48:50,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 236 transitions, 781 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-10 11:48:51,004 INFO L231 Difference]: Finished difference. Result has 185 places, 195 transitions, 592 flow [2023-11-10 11:48:51,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=592, PETRI_PLACES=185, PETRI_TRANSITIONS=195} [2023-11-10 11:48:51,005 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 5 predicate places. [2023-11-10 11:48:51,006 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 195 transitions, 592 flow [2023-11-10 11:48:51,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:51,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:51,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:51,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:48:51,007 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:48:51,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:51,008 INFO L85 PathProgramCache]: Analyzing trace with hash -431995912, now seen corresponding path program 1 times [2023-11-10 11:48:51,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:51,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678060623] [2023-11-10 11:48:51,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:51,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:51,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:51,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678060623] [2023-11-10 11:48:51,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678060623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:51,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:51,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:48:51,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941809771] [2023-11-10 11:48:51,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:51,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:48:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:51,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:48:51,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:48:51,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 196 [2023-11-10 11:48:51,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 195 transitions, 592 flow. Second operand has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:51,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:51,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 196 [2023-11-10 11:48:51,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:51,920 INFO L124 PetriNetUnfolderBase]: 1228/2866 cut-off events. [2023-11-10 11:48:51,920 INFO L125 PetriNetUnfolderBase]: For 5577/5604 co-relation queries the response was YES. [2023-11-10 11:48:51,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8614 conditions, 2866 events. 1228/2866 cut-off events. For 5577/5604 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 20882 event pairs, 299 based on Foata normal form. 47/2894 useless extension candidates. Maximal degree in co-relation 7720. Up to 1190 conditions per place. [2023-11-10 11:48:51,945 INFO L140 encePairwiseOnDemand]: 177/196 looper letters, 86 selfloop transitions, 43 changer transitions 62/285 dead transitions. [2023-11-10 11:48:51,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 285 transitions, 1534 flow [2023-11-10 11:48:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-10 11:48:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-10 11:48:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1275 transitions. [2023-11-10 11:48:51,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5913729128014842 [2023-11-10 11:48:51,950 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1275 transitions. [2023-11-10 11:48:51,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1275 transitions. [2023-11-10 11:48:51,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:51,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1275 transitions. [2023-11-10 11:48:51,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.9090909090909) internal successors, (1275), 11 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:51,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 196.0) internal successors, (2352), 12 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:51,958 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 196.0) internal successors, (2352), 12 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:51,958 INFO L175 Difference]: Start difference. First operand has 185 places, 195 transitions, 592 flow. Second operand 11 states and 1275 transitions. [2023-11-10 11:48:51,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 285 transitions, 1534 flow [2023-11-10 11:48:51,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 285 transitions, 1534 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:48:51,973 INFO L231 Difference]: Finished difference. Result has 203 places, 207 transitions, 920 flow [2023-11-10 11:48:51,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=920, PETRI_PLACES=203, PETRI_TRANSITIONS=207} [2023-11-10 11:48:51,975 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 23 predicate places. [2023-11-10 11:48:51,975 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 207 transitions, 920 flow [2023-11-10 11:48:51,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:51,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:51,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:51,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 11:48:51,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:48:51,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:51,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1965368223, now seen corresponding path program 1 times [2023-11-10 11:48:51,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:51,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317780843] [2023-11-10 11:48:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:51,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:52,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:52,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317780843] [2023-11-10 11:48:52,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317780843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:52,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:52,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-10 11:48:52,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847645314] [2023-11-10 11:48:52,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:52,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-10 11:48:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:52,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-10 11:48:52,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-10 11:48:52,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 196 [2023-11-10 11:48:52,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 207 transitions, 920 flow. Second operand has 5 states, 5 states have (on average 169.2) internal successors, (846), 5 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:52,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:52,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 196 [2023-11-10 11:48:52,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:52,206 INFO L124 PetriNetUnfolderBase]: 4/167 cut-off events. [2023-11-10 11:48:52,206 INFO L125 PetriNetUnfolderBase]: For 300/360 co-relation queries the response was YES. [2023-11-10 11:48:52,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 167 events. 4/167 cut-off events. For 300/360 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 202 event pairs, 4 based on Foata normal form. 8/173 useless extension candidates. Maximal degree in co-relation 317. Up to 13 conditions per place. [2023-11-10 11:48:52,207 INFO L140 encePairwiseOnDemand]: 191/196 looper letters, 9 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2023-11-10 11:48:52,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 139 transitions, 430 flow [2023-11-10 11:48:52,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-10 11:48:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-10 11:48:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1016 transitions. [2023-11-10 11:48:52,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8639455782312925 [2023-11-10 11:48:52,210 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1016 transitions. [2023-11-10 11:48:52,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1016 transitions. [2023-11-10 11:48:52,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:52,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1016 transitions. [2023-11-10 11:48:52,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:52,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:52,215 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:52,216 INFO L175 Difference]: Start difference. First operand has 203 places, 207 transitions, 920 flow. Second operand 6 states and 1016 transitions. [2023-11-10 11:48:52,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 139 transitions, 430 flow [2023-11-10 11:48:52,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 139 transitions, 316 flow, removed 33 selfloop flow, removed 16 redundant places. [2023-11-10 11:48:52,219 INFO L231 Difference]: Finished difference. Result has 152 places, 139 transitions, 298 flow [2023-11-10 11:48:52,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=152, PETRI_TRANSITIONS=139} [2023-11-10 11:48:52,220 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, -28 predicate places. [2023-11-10 11:48:52,220 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 139 transitions, 298 flow [2023-11-10 11:48:52,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 169.2) internal successors, (846), 5 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:52,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:52,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:52,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:48:52,222 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:48:52,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1500950838, now seen corresponding path program 1 times [2023-11-10 11:48:52,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:52,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015287483] [2023-11-10 11:48:52,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:52,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:53,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:53,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015287483] [2023-11-10 11:48:53,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015287483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:53,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:53,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:48:53,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58962470] [2023-11-10 11:48:53,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:53,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:48:53,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:53,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:48:53,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:48:53,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 196 [2023-11-10 11:48:53,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 139 transitions, 298 flow. Second operand has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:53,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:53,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 196 [2023-11-10 11:48:53,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:53,885 INFO L124 PetriNetUnfolderBase]: 163/557 cut-off events. [2023-11-10 11:48:53,885 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-10 11:48:53,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 557 events. 163/557 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2519 event pairs, 23 based on Foata normal form. 4/557 useless extension candidates. Maximal degree in co-relation 1003. Up to 92 conditions per place. [2023-11-10 11:48:53,890 INFO L140 encePairwiseOnDemand]: 182/196 looper letters, 111 selfloop transitions, 18 changer transitions 0/239 dead transitions. [2023-11-10 11:48:53,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 239 transitions, 810 flow [2023-11-10 11:48:53,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:48:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:48:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2145 transitions. [2023-11-10 11:48:53,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8418367346938775 [2023-11-10 11:48:53,895 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2145 transitions. [2023-11-10 11:48:53,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2145 transitions. [2023-11-10 11:48:53,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:53,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2145 transitions. [2023-11-10 11:48:53,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 165.0) internal successors, (2145), 13 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:53,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 196.0) internal successors, (2744), 14 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:53,907 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 196.0) internal successors, (2744), 14 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:53,907 INFO L175 Difference]: Start difference. First operand has 152 places, 139 transitions, 298 flow. Second operand 13 states and 2145 transitions. [2023-11-10 11:48:53,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 239 transitions, 810 flow [2023-11-10 11:48:53,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 239 transitions, 803 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-10 11:48:53,912 INFO L231 Difference]: Finished difference. Result has 166 places, 151 transitions, 385 flow [2023-11-10 11:48:53,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=385, PETRI_PLACES=166, PETRI_TRANSITIONS=151} [2023-11-10 11:48:53,915 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, -14 predicate places. [2023-11-10 11:48:53,915 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 151 transitions, 385 flow [2023-11-10 11:48:53,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:53,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:53,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:53,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:48:53,917 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:48:53,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:53,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2146375386, now seen corresponding path program 2 times [2023-11-10 11:48:53,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:53,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131203559] [2023-11-10 11:48:53,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:53,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:56,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:56,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131203559] [2023-11-10 11:48:56,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131203559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:56,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:56,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-10 11:48:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400362682] [2023-11-10 11:48:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:56,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-10 11:48:56,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:56,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-10 11:48:56,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2023-11-10 11:48:56,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 196 [2023-11-10 11:48:56,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 151 transitions, 385 flow. Second operand has 16 states, 16 states have (on average 81.4375) internal successors, (1303), 16 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:56,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:56,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 196 [2023-11-10 11:48:56,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:56,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= (store |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1)) |v_#memory_int_29|) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][105], [24#L1711-1true, 345#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 260#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 28)) 1) 0) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 268#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 254#(= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0), Black: 266#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 243#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), 39#L1750-4true, 294#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), 22#L1714true, Black: 310#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 308#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 304#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 312#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 295#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 306#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base))]) [2023-11-10 11:48:56,834 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-10 11:48:56,835 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-10 11:48:56,835 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-10 11:48:56,835 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-10 11:48:56,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= (store |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1)) |v_#memory_int_29|) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][105], [24#L1711-1true, 288#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), 345#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 260#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 28)) 1) 0) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 268#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 254#(= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0), Black: 266#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 243#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), 294#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 310#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), 22#L1714true, Black: 308#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 304#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 312#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), 92#L1752-1true, Black: 295#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 306#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base))]) [2023-11-10 11:48:56,913 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2023-11-10 11:48:56,913 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-10 11:48:56,913 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-10 11:48:56,913 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-10 11:48:56,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= (store |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1)) |v_#memory_int_29|) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][105], [24#L1711-1true, 9#L1733true, 288#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), 345#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 260#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 28)) 1) 0) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 268#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 254#(= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0), Black: 266#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 243#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), 294#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), 22#L1714true, Black: 310#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 308#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 304#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 312#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 295#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 306#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base))]) [2023-11-10 11:48:56,937 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-10 11:48:56,937 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-10 11:48:56,937 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-10 11:48:56,937 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-10 11:48:56,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= (store |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1)) |v_#memory_int_29|) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][151], [111#L1734-1true, 24#L1711-1true, 288#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), Black: 260#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 28)) 1) 0) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 268#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 254#(= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0), Black: 266#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), 347#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 243#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), 294#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 310#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), 22#L1714true, Black: 308#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 304#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 312#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 295#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 306#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base))]) [2023-11-10 11:48:56,941 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-10 11:48:56,942 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-10 11:48:56,942 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-10 11:48:56,942 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-10 11:48:56,958 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= (store |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1)) |v_#memory_int_29|) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][151], [24#L1711-1true, 288#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), Black: 260#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 28)) 1) 0) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 268#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 254#(= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0), Black: 266#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), 347#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 243#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), 294#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 310#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), 22#L1714true, 98#L1735true, Black: 308#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 304#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 312#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 295#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 306#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base))]) [2023-11-10 11:48:56,958 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-10 11:48:56,958 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-10 11:48:56,958 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-10 11:48:56,958 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-10 11:48:56,970 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([419] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= (store |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1)) |v_#memory_int_29|) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][151], [111#L1734-1true, 24#L1711-1true, 288#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), Black: 260#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 28)) 1) 0) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 268#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 254#(= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0), Black: 266#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), 347#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 243#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), 294#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 310#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), 22#L1714true, Black: 308#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 304#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 312#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 295#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 306#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base))]) [2023-11-10 11:48:56,970 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-10 11:48:56,970 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-10 11:48:56,970 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-10 11:48:56,970 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-10 11:48:56,970 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-10 11:48:56,985 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([419] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= (store |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1)) |v_#memory_int_29|) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][151], [24#L1711-1true, 288#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), Black: 260#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 28)) 1) 0) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 268#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 254#(= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0), Black: 266#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), 347#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 243#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), 294#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), 22#L1714true, Black: 310#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), 98#L1735true, Black: 308#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 304#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 312#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 295#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 306#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base))]) [2023-11-10 11:48:56,986 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-10 11:48:56,986 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-10 11:48:56,986 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-10 11:48:56,986 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-10 11:48:56,986 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-10 11:48:57,274 INFO L124 PetriNetUnfolderBase]: 1015/2526 cut-off events. [2023-11-10 11:48:57,275 INFO L125 PetriNetUnfolderBase]: For 950/955 co-relation queries the response was YES. [2023-11-10 11:48:57,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5609 conditions, 2526 events. 1015/2526 cut-off events. For 950/955 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 17769 event pairs, 57 based on Foata normal form. 0/2497 useless extension candidates. Maximal degree in co-relation 5595. Up to 591 conditions per place. [2023-11-10 11:48:57,295 INFO L140 encePairwiseOnDemand]: 169/196 looper letters, 215 selfloop transitions, 29 changer transitions 0/308 dead transitions. [2023-11-10 11:48:57,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 308 transitions, 1422 flow [2023-11-10 11:48:57,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-10 11:48:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-10 11:48:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1825 transitions. [2023-11-10 11:48:57,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4433916423712342 [2023-11-10 11:48:57,301 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1825 transitions. [2023-11-10 11:48:57,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1825 transitions. [2023-11-10 11:48:57,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:57,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1825 transitions. [2023-11-10 11:48:57,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 86.9047619047619) internal successors, (1825), 21 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:57,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 196.0) internal successors, (4312), 22 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:57,313 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 196.0) internal successors, (4312), 22 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:57,314 INFO L175 Difference]: Start difference. First operand has 166 places, 151 transitions, 385 flow. Second operand 21 states and 1825 transitions. [2023-11-10 11:48:57,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 308 transitions, 1422 flow [2023-11-10 11:48:57,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 308 transitions, 1379 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-10 11:48:57,321 INFO L231 Difference]: Finished difference. Result has 193 places, 167 transitions, 536 flow [2023-11-10 11:48:57,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=536, PETRI_PLACES=193, PETRI_TRANSITIONS=167} [2023-11-10 11:48:57,322 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 13 predicate places. [2023-11-10 11:48:57,322 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 167 transitions, 536 flow [2023-11-10 11:48:57,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 81.4375) internal successors, (1303), 16 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:57,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:57,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:57,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-10 11:48:57,323 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:48:57,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:57,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1700206510, now seen corresponding path program 3 times [2023-11-10 11:48:57,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:57,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816806080] [2023-11-10 11:48:57,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:57,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:48:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:48:58,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:48:58,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816806080] [2023-11-10 11:48:58,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816806080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:48:58,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:48:58,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:48:58,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069680304] [2023-11-10 11:48:58,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:48:58,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:48:58,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:48:58,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:48:58,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:48:58,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 196 [2023-11-10 11:48:58,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 167 transitions, 536 flow. Second operand has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:58,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:48:58,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 196 [2023-11-10 11:48:58,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:48:58,608 INFO L124 PetriNetUnfolderBase]: 340/1150 cut-off events. [2023-11-10 11:48:58,608 INFO L125 PetriNetUnfolderBase]: For 742/1048 co-relation queries the response was YES. [2023-11-10 11:48:58,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 1150 events. 340/1150 cut-off events. For 742/1048 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6954 event pairs, 34 based on Foata normal form. 22/1153 useless extension candidates. Maximal degree in co-relation 2877. Up to 216 conditions per place. [2023-11-10 11:48:58,618 INFO L140 encePairwiseOnDemand]: 182/196 looper letters, 160 selfloop transitions, 29 changer transitions 0/308 dead transitions. [2023-11-10 11:48:58,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 308 transitions, 1582 flow [2023-11-10 11:48:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:48:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:48:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2145 transitions. [2023-11-10 11:48:58,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8418367346938775 [2023-11-10 11:48:58,623 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2145 transitions. [2023-11-10 11:48:58,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2145 transitions. [2023-11-10 11:48:58,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:48:58,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2145 transitions. [2023-11-10 11:48:58,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 165.0) internal successors, (2145), 13 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:58,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 196.0) internal successors, (2744), 14 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:58,634 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 196.0) internal successors, (2744), 14 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:58,634 INFO L175 Difference]: Start difference. First operand has 193 places, 167 transitions, 536 flow. Second operand 13 states and 2145 transitions. [2023-11-10 11:48:58,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 308 transitions, 1582 flow [2023-11-10 11:48:58,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 308 transitions, 1563 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-10 11:48:58,643 INFO L231 Difference]: Finished difference. Result has 204 places, 184 transitions, 711 flow [2023-11-10 11:48:58,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=711, PETRI_PLACES=204, PETRI_TRANSITIONS=184} [2023-11-10 11:48:58,644 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 24 predicate places. [2023-11-10 11:48:58,644 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 184 transitions, 711 flow [2023-11-10 11:48:58,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:48:58,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:48:58,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:48:58,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 11:48:58,645 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:48:58,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:48:58,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1789767768, now seen corresponding path program 4 times [2023-11-10 11:48:58,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:48:58,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678605690] [2023-11-10 11:48:58,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:48:58,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:48:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:49:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:49:00,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:49:00,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678605690] [2023-11-10 11:49:00,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678605690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:49:00,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:49:00,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-10 11:49:00,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079449755] [2023-11-10 11:49:00,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:49:00,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-10 11:49:00,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:49:00,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-10 11:49:00,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-11-10 11:49:00,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 196 [2023-11-10 11:49:00,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 184 transitions, 711 flow. Second operand has 16 states, 16 states have (on average 81.4375) internal successors, (1303), 16 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:00,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:49:00,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 196 [2023-11-10 11:49:00,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:49:01,810 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_7 24))) (and (= |v_#memory_int_29| (store |v_#memory_int_30| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 1))) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.offset_17|))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_7, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_7, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][273], [288#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), 345#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), 153#L1711-1true, Black: 260#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 28)) 1) 0) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 268#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 254#(= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0), Black: 266#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 397#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= (+ my_callbackThread1of1ForFork0_~data~0.offset 24) my_callbackThread1of1ForFork1_~__mptr~0.offset) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= my_callbackThread1of1ForFork1_~__mptr~0.base my_callbackThread1of1ForFork0_~data~0.base)), 472#(and (= (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= 0 my_callbackThread1of1ForFork0_~data~0.offset) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 399#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= (+ my_callbackThread1of1ForFork0_~data~0.offset 24) my_callbackThread1of1ForFork1_~__mptr~0.offset) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= my_callbackThread1of1ForFork1_~__mptr~0.base my_callbackThread1of1ForFork0_~data~0.base)), Black: 403#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1)), Black: 405#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1)), Black: 401#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1)), Black: 388#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1)), 9#L1733true, 387#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base)), 295#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 353#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 365#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 347#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 361#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 243#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), Black: 359#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) 24) 1) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 349#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 351#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= ~my_dev~0.offset 24) (= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 357#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1) (not (= my_callbackThread1of1ForFork1_~data~0.base |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|))), Black: 310#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 308#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 367#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 304#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 363#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 312#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), 144#L1714true, Black: 355#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 306#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base))]) [2023-11-10 11:49:01,813 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-10 11:49:01,813 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-10 11:49:01,813 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-10 11:49:01,813 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-10 11:49:01,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_7 24))) (and (= |v_#memory_int_29| (store |v_#memory_int_30| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 1))) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.offset_17|))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_7, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_7, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][359], [111#L1734-1true, 288#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), 153#L1711-1true, Black: 260#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 28)) 1) 0) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 268#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 254#(= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0), Black: 266#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 397#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= (+ my_callbackThread1of1ForFork0_~data~0.offset 24) my_callbackThread1of1ForFork1_~__mptr~0.offset) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= my_callbackThread1of1ForFork1_~__mptr~0.base my_callbackThread1of1ForFork0_~data~0.base)), Black: 399#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= (+ my_callbackThread1of1ForFork0_~data~0.offset 24) my_callbackThread1of1ForFork1_~__mptr~0.offset) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= my_callbackThread1of1ForFork1_~__mptr~0.base my_callbackThread1of1ForFork0_~data~0.base)), Black: 403#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1)), Black: 405#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1)), Black: 401#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1)), Black: 388#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1)), 387#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base)), 295#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 353#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), 474#(and (= (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= 0 my_callbackThread1of1ForFork0_~data~0.offset) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 365#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), 347#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 361#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 243#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), Black: 359#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) 24) 1) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 349#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 351#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= ~my_dev~0.offset 24) (= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 357#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1) (not (= my_callbackThread1of1ForFork1_~data~0.base |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|))), Black: 310#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 367#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 308#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 345#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 304#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 363#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 312#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), 144#L1714true, Black: 355#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 306#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base))]) [2023-11-10 11:49:01,845 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-10 11:49:01,846 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-10 11:49:01,846 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-10 11:49:01,846 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-10 11:49:01,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_7 24))) (and (= |v_#memory_int_29| (store |v_#memory_int_30| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 1))) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.offset_17|))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_7, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_7, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][359], [288#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), 153#L1711-1true, Black: 260#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 28)) 1) 0) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 268#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 254#(= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0), Black: 266#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 397#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= (+ my_callbackThread1of1ForFork0_~data~0.offset 24) my_callbackThread1of1ForFork1_~__mptr~0.offset) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= my_callbackThread1of1ForFork1_~__mptr~0.base my_callbackThread1of1ForFork0_~data~0.base)), Black: 399#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= (+ my_callbackThread1of1ForFork0_~data~0.offset 24) my_callbackThread1of1ForFork1_~__mptr~0.offset) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= my_callbackThread1of1ForFork1_~__mptr~0.base my_callbackThread1of1ForFork0_~data~0.base)), Black: 403#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1)), Black: 405#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1)), 98#L1735true, Black: 401#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1)), Black: 388#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1)), 387#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base)), 295#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 353#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), 474#(and (= (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= 0 my_callbackThread1of1ForFork0_~data~0.offset) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 365#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), 347#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 361#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 243#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), Black: 359#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) 24) 1) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 349#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 351#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= ~my_dev~0.offset 24) (= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 310#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 357#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1) (not (= my_callbackThread1of1ForFork1_~data~0.base |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|))), Black: 367#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 308#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 345#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 304#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 363#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 312#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), 144#L1714true, Black: 355#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 306#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base))]) [2023-11-10 11:49:01,862 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-10 11:49:01,863 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-10 11:49:01,863 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-10 11:49:01,863 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-10 11:49:01,883 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_7 24))) (and (= |v_#memory_int_29| (store |v_#memory_int_30| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 1))) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.offset_17|))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_7, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_7, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][359], [288#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), 153#L1711-1true, Black: 260#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 28)) 1) 0) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 268#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), 177#L1735-1true, Black: 254#(= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0), Black: 266#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 397#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= (+ my_callbackThread1of1ForFork0_~data~0.offset 24) my_callbackThread1of1ForFork1_~__mptr~0.offset) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= my_callbackThread1of1ForFork1_~__mptr~0.base my_callbackThread1of1ForFork0_~data~0.base)), Black: 399#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= (+ my_callbackThread1of1ForFork0_~data~0.offset 24) my_callbackThread1of1ForFork1_~__mptr~0.offset) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= my_callbackThread1of1ForFork1_~__mptr~0.base my_callbackThread1of1ForFork0_~data~0.base)), Black: 403#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1)), Black: 405#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1)), Black: 401#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1)), Black: 388#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1)), 387#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base)), 295#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), 474#(and (= (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= 0 my_callbackThread1of1ForFork0_~data~0.offset) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 353#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 365#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), 347#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 361#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 243#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), Black: 359#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) 24) 1) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 349#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 351#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= ~my_dev~0.offset 24) (= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 357#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1) (not (= my_callbackThread1of1ForFork1_~data~0.base |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|))), Black: 310#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 308#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 367#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 345#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 304#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 363#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 312#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 355#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 306#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base))]) [2023-11-10 11:49:01,883 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-10 11:49:01,883 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-10 11:49:01,883 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-10 11:49:01,883 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-10 11:49:01,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_7 24))) (and (= |v_#memory_int_29| (store |v_#memory_int_30| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 1))) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.offset_17|))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_7, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_7, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][359], [288#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), 153#L1711-1true, Black: 260#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 28)) 1) 0) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 268#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 254#(= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0), Black: 266#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 397#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= (+ my_callbackThread1of1ForFork0_~data~0.offset 24) my_callbackThread1of1ForFork1_~__mptr~0.offset) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= my_callbackThread1of1ForFork1_~__mptr~0.base my_callbackThread1of1ForFork0_~data~0.base)), 96#L1735-2true, Black: 399#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= (+ my_callbackThread1of1ForFork0_~data~0.offset 24) my_callbackThread1of1ForFork1_~__mptr~0.offset) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= my_callbackThread1of1ForFork1_~__mptr~0.base my_callbackThread1of1ForFork0_~data~0.base)), Black: 403#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1)), Black: 405#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1)), Black: 401#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1)), Black: 388#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1)), 387#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base)), 295#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 353#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), 474#(and (= (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= 0 my_callbackThread1of1ForFork0_~data~0.offset) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 365#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), 347#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 361#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 243#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), Black: 359#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) 24) 1) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 349#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 351#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= ~my_dev~0.offset 24) (= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 357#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1) (not (= my_callbackThread1of1ForFork1_~data~0.base |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|))), Black: 310#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 367#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 308#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 345#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 304#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 363#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 312#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 355#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 306#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base))]) [2023-11-10 11:49:01,909 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-10 11:49:01,909 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-10 11:49:01,909 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-10 11:49:01,909 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-10 11:49:01,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_7 24))) (and (= |v_#memory_int_29| (store |v_#memory_int_30| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 1))) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.offset_17|))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_7, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_7, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][359], [288#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), 47#L1736-1true, 153#L1711-1true, Black: 260#(and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 28)) 1) 0) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 268#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 254#(= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0), Black: 266#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem50#1| 1) 0)), Black: 397#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= (+ my_callbackThread1of1ForFork0_~data~0.offset 24) my_callbackThread1of1ForFork1_~__mptr~0.offset) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= my_callbackThread1of1ForFork1_~__mptr~0.base my_callbackThread1of1ForFork0_~data~0.base)), Black: 399#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= (+ my_callbackThread1of1ForFork0_~data~0.offset 24) my_callbackThread1of1ForFork1_~__mptr~0.offset) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= my_callbackThread1of1ForFork1_~__mptr~0.base my_callbackThread1of1ForFork0_~data~0.base)), Black: 403#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1)), Black: 405#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1)), Black: 401#(and (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.base| my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1)), Black: 388#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1)), 387#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork0_~data~0.offset 24)) (= ~my_dev~0.base my_callbackThread1of1ForFork0_~data~0.base)), 295#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), 474#(and (= (select (select |#memory_int| my_callbackThread1of1ForFork0_~data~0.base) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= 0 my_callbackThread1of1ForFork0_~data~0.offset) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 353#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 365#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), 347#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 361#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 243#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), Black: 359#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select (select |#memory_int| my_callbackThread1of1ForFork1_~data~0.base) 24) 1) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 349#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 351#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= ~my_dev~0.offset 24) (= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 357#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1) (not (= my_callbackThread1of1ForFork1_~data~0.base |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|))), Black: 310#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) my_callbackThread1of1ForFork0_~data~0.offset) 1) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 367#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 308#(and (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 345#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 304#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 363#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) 24) 1) (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |ULTIMATE.start_main_#t~mem47#1| 1) (= ~my_dev~0.offset 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 312#(and (= my_callbackThread1of1ForFork1_~data~0.offset my_callbackThread1of1ForFork0_~data~0.offset) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base)), Black: 355#(and (= |ULTIMATE.start_main_~#data~1#1.base| ~my_dev~0.base) (= |my_callbackThread1of1ForFork1_#t~nondet31.offset| 0) (= |ULTIMATE.start_main_~#data~1#1.base| |my_callbackThread1of1ForFork1_#t~nondet31.base|) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset 24) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1)), Black: 306#(and (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= ~my_dev~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork0_~__mptr~0.offset (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |my_callbackThread1of1ForFork0_#t~nondet31.offset| my_callbackThread1of1ForFork1_~data~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= ~my_dev~0.base my_callbackThread1of1ForFork1_~data~0.base))]) [2023-11-10 11:49:01,932 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-10 11:49:01,932 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-10 11:49:01,932 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-10 11:49:01,932 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-10 11:49:02,117 INFO L124 PetriNetUnfolderBase]: 1642/4202 cut-off events. [2023-11-10 11:49:02,117 INFO L125 PetriNetUnfolderBase]: For 4510/4569 co-relation queries the response was YES. [2023-11-10 11:49:02,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11948 conditions, 4202 events. 1642/4202 cut-off events. For 4510/4569 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 34542 event pairs, 130 based on Foata normal form. 21/4189 useless extension candidates. Maximal degree in co-relation 11916. Up to 726 conditions per place. [2023-11-10 11:49:02,160 INFO L140 encePairwiseOnDemand]: 166/196 looper letters, 295 selfloop transitions, 74 changer transitions 0/447 dead transitions. [2023-11-10 11:49:02,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 447 transitions, 2760 flow [2023-11-10 11:49:02,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-10 11:49:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-11-10 11:49:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2735 transitions. [2023-11-10 11:49:02,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43606505102040816 [2023-11-10 11:49:02,168 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 2735 transitions. [2023-11-10 11:49:02,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 2735 transitions. [2023-11-10 11:49:02,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:49:02,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2735 transitions. [2023-11-10 11:49:02,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 85.46875) internal successors, (2735), 32 states have internal predecessors, (2735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:02,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 196.0) internal successors, (6468), 33 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:02,197 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 196.0) internal successors, (6468), 33 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:02,197 INFO L175 Difference]: Start difference. First operand has 204 places, 184 transitions, 711 flow. Second operand 32 states and 2735 transitions. [2023-11-10 11:49:02,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 447 transitions, 2760 flow [2023-11-10 11:49:02,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 447 transitions, 2636 flow, removed 35 selfloop flow, removed 5 redundant places. [2023-11-10 11:49:02,239 INFO L231 Difference]: Finished difference. Result has 239 places, 234 transitions, 1118 flow [2023-11-10 11:49:02,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1118, PETRI_PLACES=239, PETRI_TRANSITIONS=234} [2023-11-10 11:49:02,240 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 59 predicate places. [2023-11-10 11:49:02,240 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 234 transitions, 1118 flow [2023-11-10 11:49:02,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 81.4375) internal successors, (1303), 16 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:02,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:49:02,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:49:02,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 11:49:02,242 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:49:02,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:49:02,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2090699690, now seen corresponding path program 5 times [2023-11-10 11:49:02,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:49:02,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830247731] [2023-11-10 11:49:02,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:49:02,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:49:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:49:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:49:03,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:49:03,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830247731] [2023-11-10 11:49:03,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830247731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:49:03,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:49:03,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-10 11:49:03,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780024468] [2023-11-10 11:49:03,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:49:03,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-10 11:49:03,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:49:03,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-10 11:49:03,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-11-10 11:49:03,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 196 [2023-11-10 11:49:03,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 234 transitions, 1118 flow. Second operand has 16 states, 16 states have (on average 81.4375) internal successors, (1303), 16 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:03,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:49:03,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 196 [2023-11-10 11:49:03,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:49:05,934 INFO L124 PetriNetUnfolderBase]: 2680/6447 cut-off events. [2023-11-10 11:49:05,934 INFO L125 PetriNetUnfolderBase]: For 10788/10817 co-relation queries the response was YES. [2023-11-10 11:49:05,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20089 conditions, 6447 events. 2680/6447 cut-off events. For 10788/10817 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 54111 event pairs, 145 based on Foata normal form. 22/6419 useless extension candidates. Maximal degree in co-relation 20049. Up to 996 conditions per place. [2023-11-10 11:49:05,994 INFO L140 encePairwiseOnDemand]: 166/196 looper letters, 292 selfloop transitions, 175 changer transitions 0/553 dead transitions. [2023-11-10 11:49:05,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 553 transitions, 3740 flow [2023-11-10 11:49:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-10 11:49:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-11-10 11:49:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2741 transitions. [2023-11-10 11:49:06,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4370216836734694 [2023-11-10 11:49:06,003 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 2741 transitions. [2023-11-10 11:49:06,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 2741 transitions. [2023-11-10 11:49:06,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:49:06,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2741 transitions. [2023-11-10 11:49:06,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 85.65625) internal successors, (2741), 32 states have internal predecessors, (2741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:06,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 196.0) internal successors, (6468), 33 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:06,021 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 196.0) internal successors, (6468), 33 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:06,022 INFO L175 Difference]: Start difference. First operand has 239 places, 234 transitions, 1118 flow. Second operand 32 states and 2741 transitions. [2023-11-10 11:49:06,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 553 transitions, 3740 flow [2023-11-10 11:49:06,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 553 transitions, 3539 flow, removed 5 selfloop flow, removed 10 redundant places. [2023-11-10 11:49:06,096 INFO L231 Difference]: Finished difference. Result has 269 places, 358 transitions, 2134 flow [2023-11-10 11:49:06,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2134, PETRI_PLACES=269, PETRI_TRANSITIONS=358} [2023-11-10 11:49:06,098 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 89 predicate places. [2023-11-10 11:49:06,098 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 358 transitions, 2134 flow [2023-11-10 11:49:06,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 81.4375) internal successors, (1303), 16 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:06,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:49:06,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:49:06,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-10 11:49:06,101 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:49:06,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:49:06,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1771217392, now seen corresponding path program 6 times [2023-11-10 11:49:06,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:49:06,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292863901] [2023-11-10 11:49:06,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:49:06,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:49:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:49:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:49:08,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:49:08,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292863901] [2023-11-10 11:49:08,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292863901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:49:08,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:49:08,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-11-10 11:49:08,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552794723] [2023-11-10 11:49:08,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:49:08,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-10 11:49:08,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:49:08,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-10 11:49:08,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-11-10 11:49:08,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 196 [2023-11-10 11:49:08,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 358 transitions, 2134 flow. Second operand has 22 states, 22 states have (on average 73.54545454545455) internal successors, (1618), 22 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:08,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:49:08,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 196 [2023-11-10 11:49:08,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:49:12,827 INFO L124 PetriNetUnfolderBase]: 4161/9012 cut-off events. [2023-11-10 11:49:12,827 INFO L125 PetriNetUnfolderBase]: For 27370/27633 co-relation queries the response was YES. [2023-11-10 11:49:12,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32613 conditions, 9012 events. 4161/9012 cut-off events. For 27370/27633 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 73273 event pairs, 498 based on Foata normal form. 70/9023 useless extension candidates. Maximal degree in co-relation 32564. Up to 1750 conditions per place. [2023-11-10 11:49:12,908 INFO L140 encePairwiseOnDemand]: 161/196 looper letters, 690 selfloop transitions, 270 changer transitions 0/1012 dead transitions. [2023-11-10 11:49:12,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 1012 transitions, 8732 flow [2023-11-10 11:49:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-10 11:49:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-11-10 11:49:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 4449 transitions. [2023-11-10 11:49:12,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.412708719851577 [2023-11-10 11:49:12,916 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 4449 transitions. [2023-11-10 11:49:12,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 4449 transitions. [2023-11-10 11:49:12,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:49:12,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 4449 transitions. [2023-11-10 11:49:12,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 80.89090909090909) internal successors, (4449), 55 states have internal predecessors, (4449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:12,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 196.0) internal successors, (10976), 56 states have internal predecessors, (10976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:12,941 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 196.0) internal successors, (10976), 56 states have internal predecessors, (10976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:12,941 INFO L175 Difference]: Start difference. First operand has 269 places, 358 transitions, 2134 flow. Second operand 55 states and 4449 transitions. [2023-11-10 11:49:12,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 1012 transitions, 8732 flow [2023-11-10 11:49:13,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 1012 transitions, 8036 flow, removed 147 selfloop flow, removed 8 redundant places. [2023-11-10 11:49:13,214 INFO L231 Difference]: Finished difference. Result has 342 places, 474 transitions, 3922 flow [2023-11-10 11:49:13,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=1988, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=3922, PETRI_PLACES=342, PETRI_TRANSITIONS=474} [2023-11-10 11:49:13,216 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 162 predicate places. [2023-11-10 11:49:13,216 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 474 transitions, 3922 flow [2023-11-10 11:49:13,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 73.54545454545455) internal successors, (1618), 22 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:13,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:49:13,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:49:13,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-10 11:49:13,217 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:49:13,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:49:13,217 INFO L85 PathProgramCache]: Analyzing trace with hash -826759966, now seen corresponding path program 7 times [2023-11-10 11:49:13,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:49:13,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651471418] [2023-11-10 11:49:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:49:13,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:49:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:49:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:49:14,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:49:14,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651471418] [2023-11-10 11:49:14,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651471418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:49:14,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:49:14,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-10 11:49:14,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356054725] [2023-11-10 11:49:14,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:49:14,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-10 11:49:14,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:49:14,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-10 11:49:14,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-10 11:49:14,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 196 [2023-11-10 11:49:14,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 474 transitions, 3922 flow. Second operand has 16 states, 16 states have (on average 81.4375) internal successors, (1303), 16 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:14,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:49:14,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 196 [2023-11-10 11:49:14,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:49:17,532 INFO L124 PetriNetUnfolderBase]: 3361/8370 cut-off events. [2023-11-10 11:49:17,532 INFO L125 PetriNetUnfolderBase]: For 34768/34961 co-relation queries the response was YES. [2023-11-10 11:49:17,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32429 conditions, 8370 events. 3361/8370 cut-off events. For 34768/34961 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 74918 event pairs, 170 based on Foata normal form. 100/8401 useless extension candidates. Maximal degree in co-relation 32353. Up to 1109 conditions per place. [2023-11-10 11:49:17,610 INFO L140 encePairwiseOnDemand]: 166/196 looper letters, 365 selfloop transitions, 292 changer transitions 0/743 dead transitions. [2023-11-10 11:49:17,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 743 transitions, 7192 flow [2023-11-10 11:49:17,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-10 11:49:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-11-10 11:49:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3013 transitions. [2023-11-10 11:49:17,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392128279883382 [2023-11-10 11:49:17,617 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3013 transitions. [2023-11-10 11:49:17,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3013 transitions. [2023-11-10 11:49:17,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:49:17,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3013 transitions. [2023-11-10 11:49:17,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 86.08571428571429) internal successors, (3013), 35 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:17,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 196.0) internal successors, (7056), 36 states have internal predecessors, (7056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:17,674 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 196.0) internal successors, (7056), 36 states have internal predecessors, (7056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:17,675 INFO L175 Difference]: Start difference. First operand has 342 places, 474 transitions, 3922 flow. Second operand 35 states and 3013 transitions. [2023-11-10 11:49:17,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 743 transitions, 7192 flow [2023-11-10 11:49:18,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 743 transitions, 6905 flow, removed 8 selfloop flow, removed 22 redundant places. [2023-11-10 11:49:18,030 INFO L231 Difference]: Finished difference. Result has 362 places, 508 transitions, 4900 flow [2023-11-10 11:49:18,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=3695, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=4900, PETRI_PLACES=362, PETRI_TRANSITIONS=508} [2023-11-10 11:49:18,032 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 182 predicate places. [2023-11-10 11:49:18,032 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 508 transitions, 4900 flow [2023-11-10 11:49:18,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 81.4375) internal successors, (1303), 16 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:18,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:49:18,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:49:18,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-10 11:49:18,033 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:49:18,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:49:18,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1884539256, now seen corresponding path program 8 times [2023-11-10 11:49:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:49:18,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914835753] [2023-11-10 11:49:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:49:18,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:49:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:49:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:49:19,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:49:19,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914835753] [2023-11-10 11:49:19,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914835753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:49:19,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:49:19,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-10 11:49:19,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399096841] [2023-11-10 11:49:19,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:49:19,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-10 11:49:19,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:49:19,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-10 11:49:19,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-10 11:49:19,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 196 [2023-11-10 11:49:19,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 508 transitions, 4900 flow. Second operand has 16 states, 16 states have (on average 81.4375) internal successors, (1303), 16 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:19,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:49:19,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 196 [2023-11-10 11:49:19,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:49:22,916 INFO L124 PetriNetUnfolderBase]: 3410/9748 cut-off events. [2023-11-10 11:49:22,916 INFO L125 PetriNetUnfolderBase]: For 46100/46437 co-relation queries the response was YES. [2023-11-10 11:49:22,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37730 conditions, 9748 events. 3410/9748 cut-off events. For 46100/46437 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 96270 event pairs, 384 based on Foata normal form. 156/9802 useless extension candidates. Maximal degree in co-relation 37646. Up to 1368 conditions per place. [2023-11-10 11:49:23,014 INFO L140 encePairwiseOnDemand]: 166/196 looper letters, 451 selfloop transitions, 251 changer transitions 0/848 dead transitions. [2023-11-10 11:49:23,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 848 transitions, 9333 flow [2023-11-10 11:49:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-10 11:49:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-11-10 11:49:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3004 transitions. [2023-11-10 11:49:23,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43790087463556854 [2023-11-10 11:49:23,020 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3004 transitions. [2023-11-10 11:49:23,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3004 transitions. [2023-11-10 11:49:23,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:49:23,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3004 transitions. [2023-11-10 11:49:23,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 85.82857142857142) internal successors, (3004), 35 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:23,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 196.0) internal successors, (7056), 36 states have internal predecessors, (7056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:23,033 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 196.0) internal successors, (7056), 36 states have internal predecessors, (7056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:23,034 INFO L175 Difference]: Start difference. First operand has 362 places, 508 transitions, 4900 flow. Second operand 35 states and 3004 transitions. [2023-11-10 11:49:23,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 848 transitions, 9333 flow [2023-11-10 11:49:23,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 848 transitions, 8709 flow, removed 61 selfloop flow, removed 24 redundant places. [2023-11-10 11:49:23,416 INFO L231 Difference]: Finished difference. Result has 380 places, 558 transitions, 5842 flow [2023-11-10 11:49:23,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=4416, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=5842, PETRI_PLACES=380, PETRI_TRANSITIONS=558} [2023-11-10 11:49:23,418 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 200 predicate places. [2023-11-10 11:49:23,418 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 558 transitions, 5842 flow [2023-11-10 11:49:23,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 81.4375) internal successors, (1303), 16 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:23,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:49:23,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:49:23,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-10 11:49:23,419 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:49:23,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:49:23,420 INFO L85 PathProgramCache]: Analyzing trace with hash 19907912, now seen corresponding path program 9 times [2023-11-10 11:49:23,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:49:23,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490384392] [2023-11-10 11:49:23,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:49:23,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:49:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:49:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:49:23,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:49:23,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490384392] [2023-11-10 11:49:23,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490384392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:49:23,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:49:23,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:49:23,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658836997] [2023-11-10 11:49:23,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:49:23,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:49:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:49:23,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:49:23,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:49:23,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 196 [2023-11-10 11:49:23,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 558 transitions, 5842 flow. Second operand has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:23,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:49:23,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 196 [2023-11-10 11:49:23,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:49:25,908 INFO L124 PetriNetUnfolderBase]: 2232/7649 cut-off events. [2023-11-10 11:49:25,908 INFO L125 PetriNetUnfolderBase]: For 48104/48639 co-relation queries the response was YES. [2023-11-10 11:49:25,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31814 conditions, 7649 events. 2232/7649 cut-off events. For 48104/48639 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 77566 event pairs, 741 based on Foata normal form. 84/7545 useless extension candidates. Maximal degree in co-relation 31722. Up to 3013 conditions per place. [2023-11-10 11:49:25,982 INFO L140 encePairwiseOnDemand]: 183/196 looper letters, 296 selfloop transitions, 123 changer transitions 0/786 dead transitions. [2023-11-10 11:49:25,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 786 transitions, 8727 flow [2023-11-10 11:49:25,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-10 11:49:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-10 11:49:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3056 transitions. [2023-11-10 11:49:25,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8206229860365198 [2023-11-10 11:49:25,987 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3056 transitions. [2023-11-10 11:49:25,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3056 transitions. [2023-11-10 11:49:25,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:49:25,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3056 transitions. [2023-11-10 11:49:25,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 160.8421052631579) internal successors, (3056), 19 states have internal predecessors, (3056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:25,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 196.0) internal successors, (3920), 20 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:25,997 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 196.0) internal successors, (3920), 20 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:25,997 INFO L175 Difference]: Start difference. First operand has 380 places, 558 transitions, 5842 flow. Second operand 19 states and 3056 transitions. [2023-11-10 11:49:25,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 786 transitions, 8727 flow [2023-11-10 11:49:26,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 786 transitions, 8247 flow, removed 21 selfloop flow, removed 25 redundant places. [2023-11-10 11:49:26,323 INFO L231 Difference]: Finished difference. Result has 389 places, 655 transitions, 6807 flow [2023-11-10 11:49:26,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=5476, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=6807, PETRI_PLACES=389, PETRI_TRANSITIONS=655} [2023-11-10 11:49:26,324 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 209 predicate places. [2023-11-10 11:49:26,324 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 655 transitions, 6807 flow [2023-11-10 11:49:26,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:26,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:49:26,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:49:26,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-10 11:49:26,325 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:49:26,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:49:26,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1418955102, now seen corresponding path program 10 times [2023-11-10 11:49:26,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:49:26,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51651101] [2023-11-10 11:49:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:49:26,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:49:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:49:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:49:26,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:49:26,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51651101] [2023-11-10 11:49:26,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51651101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:49:26,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:49:26,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:49:26,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861325324] [2023-11-10 11:49:26,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:49:26,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:49:26,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:49:26,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:49:26,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:49:26,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 196 [2023-11-10 11:49:26,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 655 transitions, 6807 flow. Second operand has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:26,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:49:26,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 196 [2023-11-10 11:49:26,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:49:29,078 INFO L124 PetriNetUnfolderBase]: 2472/8031 cut-off events. [2023-11-10 11:49:29,079 INFO L125 PetriNetUnfolderBase]: For 62989/63794 co-relation queries the response was YES. [2023-11-10 11:49:29,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36598 conditions, 8031 events. 2472/8031 cut-off events. For 62989/63794 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 81191 event pairs, 529 based on Foata normal form. 93/7920 useless extension candidates. Maximal degree in co-relation 36490. Up to 2724 conditions per place. [2023-11-10 11:49:29,224 INFO L140 encePairwiseOnDemand]: 183/196 looper letters, 385 selfloop transitions, 162 changer transitions 0/914 dead transitions. [2023-11-10 11:49:29,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 914 transitions, 11016 flow [2023-11-10 11:49:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-10 11:49:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-10 11:49:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2296 transitions. [2023-11-10 11:49:29,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8367346938775511 [2023-11-10 11:49:29,236 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2296 transitions. [2023-11-10 11:49:29,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2296 transitions. [2023-11-10 11:49:29,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:49:29,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2296 transitions. [2023-11-10 11:49:29,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 164.0) internal successors, (2296), 14 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:29,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 196.0) internal successors, (2940), 15 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:29,244 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 196.0) internal successors, (2940), 15 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:29,244 INFO L175 Difference]: Start difference. First operand has 389 places, 655 transitions, 6807 flow. Second operand 14 states and 2296 transitions. [2023-11-10 11:49:29,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 914 transitions, 11016 flow [2023-11-10 11:49:29,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 914 transitions, 10505 flow, removed 226 selfloop flow, removed 2 redundant places. [2023-11-10 11:49:29,706 INFO L231 Difference]: Finished difference. Result has 409 places, 706 transitions, 7679 flow [2023-11-10 11:49:29,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=6458, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7679, PETRI_PLACES=409, PETRI_TRANSITIONS=706} [2023-11-10 11:49:29,707 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 229 predicate places. [2023-11-10 11:49:29,708 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 706 transitions, 7679 flow [2023-11-10 11:49:29,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:29,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:49:29,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:49:29,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-10 11:49:29,708 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:49:29,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:49:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1028588650, now seen corresponding path program 11 times [2023-11-10 11:49:29,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:49:29,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572524795] [2023-11-10 11:49:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:49:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:49:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:49:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:49:31,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:49:31,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572524795] [2023-11-10 11:49:31,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572524795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:49:31,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:49:31,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-10 11:49:31,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893619070] [2023-11-10 11:49:31,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:49:31,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-10 11:49:31,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:49:31,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-10 11:49:31,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2023-11-10 11:49:31,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 196 [2023-11-10 11:49:31,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 706 transitions, 7679 flow. Second operand has 17 states, 17 states have (on average 81.17647058823529) internal successors, (1380), 17 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:31,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:49:31,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 196 [2023-11-10 11:49:31,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:49:35,938 INFO L124 PetriNetUnfolderBase]: 6000/15604 cut-off events. [2023-11-10 11:49:35,938 INFO L125 PetriNetUnfolderBase]: For 130770/131200 co-relation queries the response was YES. [2023-11-10 11:49:36,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72845 conditions, 15604 events. 6000/15604 cut-off events. For 130770/131200 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 158823 event pairs, 1343 based on Foata normal form. 148/15550 useless extension candidates. Maximal degree in co-relation 72728. Up to 5234 conditions per place. [2023-11-10 11:49:36,111 INFO L140 encePairwiseOnDemand]: 167/196 looper letters, 463 selfloop transitions, 382 changer transitions 0/996 dead transitions. [2023-11-10 11:49:36,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 996 transitions, 12296 flow [2023-11-10 11:49:36,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-10 11:49:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-11-10 11:49:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2804 transitions. [2023-11-10 11:49:36,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43351886209029067 [2023-11-10 11:49:36,123 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2804 transitions. [2023-11-10 11:49:36,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2804 transitions. [2023-11-10 11:49:36,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:49:36,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2804 transitions. [2023-11-10 11:49:36,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 84.96969696969697) internal successors, (2804), 33 states have internal predecessors, (2804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:36,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 196.0) internal successors, (6664), 34 states have internal predecessors, (6664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:36,136 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 196.0) internal successors, (6664), 34 states have internal predecessors, (6664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:36,137 INFO L175 Difference]: Start difference. First operand has 409 places, 706 transitions, 7679 flow. Second operand 33 states and 2804 transitions. [2023-11-10 11:49:36,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 996 transitions, 12296 flow [2023-11-10 11:49:37,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 996 transitions, 11905 flow, removed 139 selfloop flow, removed 4 redundant places. [2023-11-10 11:49:37,534 INFO L231 Difference]: Finished difference. Result has 449 places, 773 transitions, 9482 flow [2023-11-10 11:49:37,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=7364, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=319, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=9482, PETRI_PLACES=449, PETRI_TRANSITIONS=773} [2023-11-10 11:49:37,535 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 269 predicate places. [2023-11-10 11:49:37,536 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 773 transitions, 9482 flow [2023-11-10 11:49:37,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 81.17647058823529) internal successors, (1380), 17 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:37,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:49:37,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:49:37,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-10 11:49:37,537 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:49:37,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:49:37,537 INFO L85 PathProgramCache]: Analyzing trace with hash -48643542, now seen corresponding path program 12 times [2023-11-10 11:49:37,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:49:37,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064171672] [2023-11-10 11:49:37,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:49:37,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:49:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:49:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:49:38,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:49:38,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064171672] [2023-11-10 11:49:38,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064171672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:49:38,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:49:38,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:49:38,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455473467] [2023-11-10 11:49:38,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:49:38,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:49:38,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:49:38,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:49:38,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:49:38,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 196 [2023-11-10 11:49:38,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 773 transitions, 9482 flow. Second operand has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:38,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:49:38,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 196 [2023-11-10 11:49:38,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:49:41,154 INFO L124 PetriNetUnfolderBase]: 3243/10736 cut-off events. [2023-11-10 11:49:41,154 INFO L125 PetriNetUnfolderBase]: For 113701/114585 co-relation queries the response was YES. [2023-11-10 11:49:41,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54101 conditions, 10736 events. 3243/10736 cut-off events. For 113701/114585 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 114828 event pairs, 1158 based on Foata normal form. 113/10581 useless extension candidates. Maximal degree in co-relation 53973. Up to 5020 conditions per place. [2023-11-10 11:49:41,266 INFO L140 encePairwiseOnDemand]: 183/196 looper letters, 415 selfloop transitions, 146 changer transitions 0/969 dead transitions. [2023-11-10 11:49:41,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 969 transitions, 13798 flow [2023-11-10 11:49:41,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-10 11:49:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-10 11:49:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2256 transitions. [2023-11-10 11:49:41,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8221574344023324 [2023-11-10 11:49:41,269 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2256 transitions. [2023-11-10 11:49:41,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2256 transitions. [2023-11-10 11:49:41,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:49:41,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2256 transitions. [2023-11-10 11:49:41,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 161.14285714285714) internal successors, (2256), 14 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:41,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 196.0) internal successors, (2940), 15 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:41,275 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 196.0) internal successors, (2940), 15 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:41,275 INFO L175 Difference]: Start difference. First operand has 449 places, 773 transitions, 9482 flow. Second operand 14 states and 2256 transitions. [2023-11-10 11:49:41,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 969 transitions, 13798 flow [2023-11-10 11:49:42,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 969 transitions, 12806 flow, removed 236 selfloop flow, removed 15 redundant places. [2023-11-10 11:49:42,213 INFO L231 Difference]: Finished difference. Result has 457 places, 876 transitions, 11032 flow [2023-11-10 11:49:42,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=8851, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=11032, PETRI_PLACES=457, PETRI_TRANSITIONS=876} [2023-11-10 11:49:42,214 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 277 predicate places. [2023-11-10 11:49:42,215 INFO L495 AbstractCegarLoop]: Abstraction has has 457 places, 876 transitions, 11032 flow [2023-11-10 11:49:42,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:42,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:49:42,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:49:42,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-10 11:49:42,215 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:49:42,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:49:42,215 INFO L85 PathProgramCache]: Analyzing trace with hash 5494506, now seen corresponding path program 13 times [2023-11-10 11:49:42,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:49:42,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627720260] [2023-11-10 11:49:42,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:49:42,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:49:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:49:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:49:42,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:49:42,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627720260] [2023-11-10 11:49:42,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627720260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:49:42,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:49:42,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:49:42,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639236344] [2023-11-10 11:49:42,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:49:42,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:49:42,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:49:42,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:49:42,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:49:42,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 196 [2023-11-10 11:49:42,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 876 transitions, 11032 flow. Second operand has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:42,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:49:42,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 196 [2023-11-10 11:49:42,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:49:46,153 INFO L124 PetriNetUnfolderBase]: 3450/10982 cut-off events. [2023-11-10 11:49:46,153 INFO L125 PetriNetUnfolderBase]: For 124063/126000 co-relation queries the response was YES. [2023-11-10 11:49:46,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58026 conditions, 10982 events. 3450/10982 cut-off events. For 124063/126000 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 117097 event pairs, 580 based on Foata normal form. 116/10851 useless extension candidates. Maximal degree in co-relation 57887. Up to 3470 conditions per place. [2023-11-10 11:49:46,400 INFO L140 encePairwiseOnDemand]: 183/196 looper letters, 488 selfloop transitions, 277 changer transitions 0/1173 dead transitions. [2023-11-10 11:49:46,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 1173 transitions, 16953 flow [2023-11-10 11:49:46,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-10 11:49:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-10 11:49:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2774 transitions. [2023-11-10 11:49:46,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8325330132052821 [2023-11-10 11:49:46,403 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2774 transitions. [2023-11-10 11:49:46,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2774 transitions. [2023-11-10 11:49:46,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:49:46,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2774 transitions. [2023-11-10 11:49:46,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 163.1764705882353) internal successors, (2774), 17 states have internal predecessors, (2774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:46,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 196.0) internal successors, (3528), 18 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:46,410 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 196.0) internal successors, (3528), 18 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:46,410 INFO L175 Difference]: Start difference. First operand has 457 places, 876 transitions, 11032 flow. Second operand 17 states and 2774 transitions. [2023-11-10 11:49:46,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 1173 transitions, 16953 flow [2023-11-10 11:49:47,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 1173 transitions, 15837 flow, removed 558 selfloop flow, removed 0 redundant places. [2023-11-10 11:49:47,621 INFO L231 Difference]: Finished difference. Result has 482 places, 927 transitions, 11910 flow [2023-11-10 11:49:47,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=10228, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=876, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=11910, PETRI_PLACES=482, PETRI_TRANSITIONS=927} [2023-11-10 11:49:47,622 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 302 predicate places. [2023-11-10 11:49:47,622 INFO L495 AbstractCegarLoop]: Abstraction has has 482 places, 927 transitions, 11910 flow [2023-11-10 11:49:47,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:47,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:49:47,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:49:47,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-10 11:49:47,623 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:49:47,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:49:47,623 INFO L85 PathProgramCache]: Analyzing trace with hash -744447088, now seen corresponding path program 14 times [2023-11-10 11:49:47,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:49:47,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088999691] [2023-11-10 11:49:47,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:49:47,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:49:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:49:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:49:48,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:49:48,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088999691] [2023-11-10 11:49:48,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088999691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:49:48,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:49:48,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-10 11:49:48,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650405173] [2023-11-10 11:49:48,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:49:48,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:49:48,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:49:48,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:49:48,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:49:48,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 196 [2023-11-10 11:49:48,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 927 transitions, 11910 flow. Second operand has 10 states, 10 states have (on average 149.7) internal successors, (1497), 10 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:48,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:49:48,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 196 [2023-11-10 11:49:48,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:49:52,252 INFO L124 PetriNetUnfolderBase]: 3900/11981 cut-off events. [2023-11-10 11:49:52,252 INFO L125 PetriNetUnfolderBase]: For 149201/153047 co-relation queries the response was YES. [2023-11-10 11:49:52,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65908 conditions, 11981 events. 3900/11981 cut-off events. For 149201/153047 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 128340 event pairs, 1531 based on Foata normal form. 216/11837 useless extension candidates. Maximal degree in co-relation 65759. Up to 6348 conditions per place. [2023-11-10 11:49:52,404 INFO L140 encePairwiseOnDemand]: 181/196 looper letters, 551 selfloop transitions, 152 changer transitions 0/1060 dead transitions. [2023-11-10 11:49:52,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 1060 transitions, 15198 flow [2023-11-10 11:49:52,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-10 11:49:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-10 11:49:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2145 transitions. [2023-11-10 11:49:52,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7817055393586005 [2023-11-10 11:49:52,407 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2145 transitions. [2023-11-10 11:49:52,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2145 transitions. [2023-11-10 11:49:52,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:49:52,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2145 transitions. [2023-11-10 11:49:52,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 153.21428571428572) internal successors, (2145), 14 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:52,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 196.0) internal successors, (2940), 15 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:52,413 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 196.0) internal successors, (2940), 15 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:52,413 INFO L175 Difference]: Start difference. First operand has 482 places, 927 transitions, 11910 flow. Second operand 14 states and 2145 transitions. [2023-11-10 11:49:52,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 1060 transitions, 15198 flow [2023-11-10 11:49:53,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 1060 transitions, 14604 flow, removed 159 selfloop flow, removed 6 redundant places. [2023-11-10 11:49:54,010 INFO L231 Difference]: Finished difference. Result has 495 places, 964 transitions, 12340 flow [2023-11-10 11:49:54,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=11410, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=927, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=794, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=12340, PETRI_PLACES=495, PETRI_TRANSITIONS=964} [2023-11-10 11:49:54,011 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 315 predicate places. [2023-11-10 11:49:54,011 INFO L495 AbstractCegarLoop]: Abstraction has has 495 places, 964 transitions, 12340 flow [2023-11-10 11:49:54,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 149.7) internal successors, (1497), 10 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:54,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:49:54,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:49:54,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-10 11:49:54,012 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:49:54,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:49:54,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1504314984, now seen corresponding path program 15 times [2023-11-10 11:49:54,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:49:54,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494103773] [2023-11-10 11:49:54,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:49:54,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:49:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:49:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:49:54,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:49:54,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494103773] [2023-11-10 11:49:54,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494103773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:49:54,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:49:54,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:49:54,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087746866] [2023-11-10 11:49:54,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:49:54,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:49:54,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:49:54,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:49:54,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:49:54,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 196 [2023-11-10 11:49:54,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 964 transitions, 12340 flow. Second operand has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:54,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:49:54,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 196 [2023-11-10 11:49:54,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:49:58,215 INFO L124 PetriNetUnfolderBase]: 3944/12241 cut-off events. [2023-11-10 11:49:58,215 INFO L125 PetriNetUnfolderBase]: For 148136/149946 co-relation queries the response was YES. [2023-11-10 11:49:58,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67713 conditions, 12241 events. 3944/12241 cut-off events. For 148136/149946 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 132244 event pairs, 1341 based on Foata normal form. 106/12014 useless extension candidates. Maximal degree in co-relation 67558. Up to 5941 conditions per place. [2023-11-10 11:49:58,365 INFO L140 encePairwiseOnDemand]: 183/196 looper letters, 534 selfloop transitions, 174 changer transitions 0/1116 dead transitions. [2023-11-10 11:49:58,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 1116 transitions, 15919 flow [2023-11-10 11:49:58,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:49:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:49:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2098 transitions. [2023-11-10 11:49:58,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8233908948194663 [2023-11-10 11:49:58,368 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2098 transitions. [2023-11-10 11:49:58,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2098 transitions. [2023-11-10 11:49:58,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:49:58,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2098 transitions. [2023-11-10 11:49:58,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 161.3846153846154) internal successors, (2098), 13 states have internal predecessors, (2098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:58,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 196.0) internal successors, (2744), 14 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:58,373 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 196.0) internal successors, (2744), 14 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:49:58,373 INFO L175 Difference]: Start difference. First operand has 495 places, 964 transitions, 12340 flow. Second operand 13 states and 2098 transitions. [2023-11-10 11:49:58,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 1116 transitions, 15919 flow [2023-11-10 11:50:00,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 1116 transitions, 15528 flow, removed 161 selfloop flow, removed 3 redundant places. [2023-11-10 11:50:00,063 INFO L231 Difference]: Finished difference. Result has 514 places, 1037 transitions, 13788 flow [2023-11-10 11:50:00,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=11999, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=964, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=13788, PETRI_PLACES=514, PETRI_TRANSITIONS=1037} [2023-11-10 11:50:00,064 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 334 predicate places. [2023-11-10 11:50:00,064 INFO L495 AbstractCegarLoop]: Abstraction has has 514 places, 1037 transitions, 13788 flow [2023-11-10 11:50:00,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:00,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:50:00,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:50:00,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-10 11:50:00,064 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:50:00,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:50:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1555113016, now seen corresponding path program 16 times [2023-11-10 11:50:00,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:50:00,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776321699] [2023-11-10 11:50:00,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:50:00,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:50:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:50:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:50:00,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:50:00,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776321699] [2023-11-10 11:50:00,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776321699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:50:00,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:50:00,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:50:00,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687486537] [2023-11-10 11:50:00,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:50:00,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:50:00,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:50:00,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:50:00,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:50:00,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 196 [2023-11-10 11:50:00,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 1037 transitions, 13788 flow. Second operand has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:00,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:50:00,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 196 [2023-11-10 11:50:00,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:50:05,459 INFO L124 PetriNetUnfolderBase]: 4281/12920 cut-off events. [2023-11-10 11:50:05,460 INFO L125 PetriNetUnfolderBase]: For 165513/167620 co-relation queries the response was YES. [2023-11-10 11:50:05,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74750 conditions, 12920 events. 4281/12920 cut-off events. For 165513/167620 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 139781 event pairs, 936 based on Foata normal form. 141/12778 useless extension candidates. Maximal degree in co-relation 74585. Up to 4460 conditions per place. [2023-11-10 11:50:05,657 INFO L140 encePairwiseOnDemand]: 183/196 looper letters, 454 selfloop transitions, 424 changer transitions 0/1286 dead transitions. [2023-11-10 11:50:05,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 1286 transitions, 19716 flow [2023-11-10 11:50:05,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-10 11:50:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-10 11:50:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3058 transitions. [2023-11-10 11:50:05,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8211600429645542 [2023-11-10 11:50:05,660 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3058 transitions. [2023-11-10 11:50:05,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3058 transitions. [2023-11-10 11:50:05,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:50:05,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3058 transitions. [2023-11-10 11:50:05,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 160.94736842105263) internal successors, (3058), 19 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:05,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 196.0) internal successors, (3920), 20 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:05,667 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 196.0) internal successors, (3920), 20 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:05,667 INFO L175 Difference]: Start difference. First operand has 514 places, 1037 transitions, 13788 flow. Second operand 19 states and 3058 transitions. [2023-11-10 11:50:05,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 1286 transitions, 19716 flow [2023-11-10 11:50:07,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 1286 transitions, 18528 flow, removed 594 selfloop flow, removed 0 redundant places. [2023-11-10 11:50:07,705 INFO L231 Difference]: Finished difference. Result has 547 places, 1153 transitions, 16322 flow [2023-11-10 11:50:07,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=13114, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1037, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=310, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=16322, PETRI_PLACES=547, PETRI_TRANSITIONS=1153} [2023-11-10 11:50:07,707 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 367 predicate places. [2023-11-10 11:50:07,707 INFO L495 AbstractCegarLoop]: Abstraction has has 547 places, 1153 transitions, 16322 flow [2023-11-10 11:50:07,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:07,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:50:07,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:50:07,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-10 11:50:07,708 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:50:07,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:50:07,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1491375594, now seen corresponding path program 17 times [2023-11-10 11:50:07,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:50:07,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230760643] [2023-11-10 11:50:07,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:50:07,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:50:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:50:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:50:08,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:50:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230760643] [2023-11-10 11:50:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230760643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:50:08,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:50:08,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:50:08,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35279826] [2023-11-10 11:50:08,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:50:08,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:50:08,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:50:08,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:50:08,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:50:08,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 196 [2023-11-10 11:50:08,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 1153 transitions, 16322 flow. Second operand has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:08,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:50:08,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 196 [2023-11-10 11:50:08,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:50:14,264 INFO L124 PetriNetUnfolderBase]: 5048/15621 cut-off events. [2023-11-10 11:50:14,265 INFO L125 PetriNetUnfolderBase]: For 212798/215070 co-relation queries the response was YES. [2023-11-10 11:50:14,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91996 conditions, 15621 events. 5048/15621 cut-off events. For 212798/215070 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 176870 event pairs, 510 based on Foata normal form. 197/15564 useless extension candidates. Maximal degree in co-relation 91815. Up to 4034 conditions per place. [2023-11-10 11:50:14,510 INFO L140 encePairwiseOnDemand]: 182/196 looper letters, 554 selfloop transitions, 543 changer transitions 0/1505 dead transitions. [2023-11-10 11:50:14,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 1505 transitions, 23823 flow [2023-11-10 11:50:14,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-10 11:50:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-10 11:50:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3257 transitions. [2023-11-10 11:50:14,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8308673469387755 [2023-11-10 11:50:14,512 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3257 transitions. [2023-11-10 11:50:14,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3257 transitions. [2023-11-10 11:50:14,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:50:14,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3257 transitions. [2023-11-10 11:50:14,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 162.85) internal successors, (3257), 20 states have internal predecessors, (3257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:14,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 196.0) internal successors, (4116), 21 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:14,520 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 196.0) internal successors, (4116), 21 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:14,520 INFO L175 Difference]: Start difference. First operand has 547 places, 1153 transitions, 16322 flow. Second operand 20 states and 3257 transitions. [2023-11-10 11:50:14,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 1505 transitions, 23823 flow [2023-11-10 11:50:17,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 1505 transitions, 22547 flow, removed 595 selfloop flow, removed 1 redundant places. [2023-11-10 11:50:17,589 INFO L231 Difference]: Finished difference. Result has 580 places, 1235 transitions, 18577 flow [2023-11-10 11:50:17,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=15592, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=461, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=18577, PETRI_PLACES=580, PETRI_TRANSITIONS=1235} [2023-11-10 11:50:17,591 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 400 predicate places. [2023-11-10 11:50:17,591 INFO L495 AbstractCegarLoop]: Abstraction has has 580 places, 1235 transitions, 18577 flow [2023-11-10 11:50:17,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:17,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:50:17,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:50:17,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-10 11:50:17,592 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:50:17,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:50:17,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2144830272, now seen corresponding path program 18 times [2023-11-10 11:50:17,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:50:17,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304544324] [2023-11-10 11:50:17,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:50:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:50:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:50:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:50:18,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:50:18,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304544324] [2023-11-10 11:50:18,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304544324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:50:18,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:50:18,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-10 11:50:18,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580984656] [2023-11-10 11:50:18,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:50:18,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-10 11:50:18,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:50:18,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-10 11:50:18,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-11-10 11:50:18,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 196 [2023-11-10 11:50:18,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 1235 transitions, 18577 flow. Second operand has 16 states, 16 states have (on average 81.4375) internal successors, (1303), 16 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:18,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:50:18,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 196 [2023-11-10 11:50:18,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:50:31,951 INFO L124 PetriNetUnfolderBase]: 10858/27688 cut-off events. [2023-11-10 11:50:31,951 INFO L125 PetriNetUnfolderBase]: For 383336/384428 co-relation queries the response was YES. [2023-11-10 11:50:32,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158337 conditions, 27688 events. 10858/27688 cut-off events. For 383336/384428 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 307145 event pairs, 3074 based on Foata normal form. 305/27578 useless extension candidates. Maximal degree in co-relation 158140. Up to 12624 conditions per place. [2023-11-10 11:50:32,537 INFO L140 encePairwiseOnDemand]: 168/196 looper letters, 790 selfloop transitions, 459 changer transitions 0/1559 dead transitions. [2023-11-10 11:50:32,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 1559 transitions, 25350 flow [2023-11-10 11:50:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-10 11:50:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-10 11:50:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2078 transitions. [2023-11-10 11:50:32,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417517006802721 [2023-11-10 11:50:32,540 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2078 transitions. [2023-11-10 11:50:32,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2078 transitions. [2023-11-10 11:50:32,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:50:32,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2078 transitions. [2023-11-10 11:50:32,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 86.58333333333333) internal successors, (2078), 24 states have internal predecessors, (2078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:32,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 196.0) internal successors, (4900), 25 states have internal predecessors, (4900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:32,547 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 196.0) internal successors, (4900), 25 states have internal predecessors, (4900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:32,547 INFO L175 Difference]: Start difference. First operand has 580 places, 1235 transitions, 18577 flow. Second operand 24 states and 2078 transitions. [2023-11-10 11:50:32,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 1559 transitions, 25350 flow [2023-11-10 11:50:40,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 1559 transitions, 24340 flow, removed 221 selfloop flow, removed 4 redundant places. [2023-11-10 11:50:40,352 INFO L231 Difference]: Finished difference. Result has 610 places, 1334 transitions, 21266 flow [2023-11-10 11:50:40,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=17805, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=362, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=809, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=21266, PETRI_PLACES=610, PETRI_TRANSITIONS=1334} [2023-11-10 11:50:40,354 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 430 predicate places. [2023-11-10 11:50:40,354 INFO L495 AbstractCegarLoop]: Abstraction has has 610 places, 1334 transitions, 21266 flow [2023-11-10 11:50:40,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 81.4375) internal successors, (1303), 16 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:40,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:50:40,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:50:40,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-10 11:50:40,354 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:50:40,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:50:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash 103069002, now seen corresponding path program 19 times [2023-11-10 11:50:40,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:50:40,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599940777] [2023-11-10 11:50:40,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:50:40,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:50:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:50:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:50:40,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:50:40,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599940777] [2023-11-10 11:50:40,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599940777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:50:40,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:50:40,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:50:40,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363780818] [2023-11-10 11:50:40,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:50:40,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:50:40,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:50:40,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:50:40,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:50:40,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 196 [2023-11-10 11:50:40,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 1334 transitions, 21266 flow. Second operand has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:40,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:50:40,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 196 [2023-11-10 11:50:40,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:50:48,278 INFO L124 PetriNetUnfolderBase]: 5082/16494 cut-off events. [2023-11-10 11:50:48,278 INFO L125 PetriNetUnfolderBase]: For 253141/256635 co-relation queries the response was YES. [2023-11-10 11:50:48,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100379 conditions, 16494 events. 5082/16494 cut-off events. For 253141/256635 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 190592 event pairs, 738 based on Foata normal form. 355/16511 useless extension candidates. Maximal degree in co-relation 100171. Up to 4863 conditions per place. [2023-11-10 11:50:48,699 INFO L140 encePairwiseOnDemand]: 182/196 looper letters, 778 selfloop transitions, 450 changer transitions 0/1657 dead transitions. [2023-11-10 11:50:48,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 1657 transitions, 29268 flow [2023-11-10 11:50:48,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-10 11:50:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-10 11:50:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3256 transitions. [2023-11-10 11:50:48,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8306122448979592 [2023-11-10 11:50:48,702 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3256 transitions. [2023-11-10 11:50:48,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3256 transitions. [2023-11-10 11:50:48,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:50:48,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3256 transitions. [2023-11-10 11:50:48,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 162.8) internal successors, (3256), 20 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:48,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 196.0) internal successors, (4116), 21 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:48,709 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 196.0) internal successors, (4116), 21 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:48,709 INFO L175 Difference]: Start difference. First operand has 610 places, 1334 transitions, 21266 flow. Second operand 20 states and 3256 transitions. [2023-11-10 11:50:48,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 1657 transitions, 29268 flow [2023-11-10 11:50:52,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 1657 transitions, 28447 flow, removed 224 selfloop flow, removed 11 redundant places. [2023-11-10 11:50:53,015 INFO L231 Difference]: Finished difference. Result has 626 places, 1359 transitions, 22221 flow [2023-11-10 11:50:53,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=20534, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=422, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=889, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=22221, PETRI_PLACES=626, PETRI_TRANSITIONS=1359} [2023-11-10 11:50:53,016 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 446 predicate places. [2023-11-10 11:50:53,016 INFO L495 AbstractCegarLoop]: Abstraction has has 626 places, 1359 transitions, 22221 flow [2023-11-10 11:50:53,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:53,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:50:53,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:50:53,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-10 11:50:53,017 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:50:53,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:50:53,018 INFO L85 PathProgramCache]: Analyzing trace with hash 327628716, now seen corresponding path program 20 times [2023-11-10 11:50:53,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:50:53,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041031801] [2023-11-10 11:50:53,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:50:53,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:50:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:50:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:50:53,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:50:53,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041031801] [2023-11-10 11:50:53,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041031801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:50:53,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:50:53,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:50:53,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723940335] [2023-11-10 11:50:53,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:50:53,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:50:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:50:53,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:50:53,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:50:53,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 196 [2023-11-10 11:50:53,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 1359 transitions, 22221 flow. Second operand has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:50:53,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:50:53,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 196 [2023-11-10 11:50:53,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:51:01,667 INFO L124 PetriNetUnfolderBase]: 5196/18057 cut-off events. [2023-11-10 11:51:01,667 INFO L125 PetriNetUnfolderBase]: For 282746/284713 co-relation queries the response was YES. [2023-11-10 11:51:01,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109061 conditions, 18057 events. 5196/18057 cut-off events. For 282746/284713 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 215680 event pairs, 1529 based on Foata normal form. 360/18035 useless extension candidates. Maximal degree in co-relation 108847. Up to 7115 conditions per place. [2023-11-10 11:51:02,024 INFO L140 encePairwiseOnDemand]: 182/196 looper letters, 848 selfloop transitions, 331 changer transitions 0/1608 dead transitions. [2023-11-10 11:51:02,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 1608 transitions, 28848 flow [2023-11-10 11:51:02,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-10 11:51:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-10 11:51:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3232 transitions. [2023-11-10 11:51:02,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8244897959183674 [2023-11-10 11:51:02,028 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3232 transitions. [2023-11-10 11:51:02,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3232 transitions. [2023-11-10 11:51:02,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:51:02,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3232 transitions. [2023-11-10 11:51:02,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 161.6) internal successors, (3232), 20 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:51:02,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 196.0) internal successors, (4116), 21 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:51:02,035 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 196.0) internal successors, (4116), 21 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:51:02,036 INFO L175 Difference]: Start difference. First operand has 626 places, 1359 transitions, 22221 flow. Second operand 20 states and 3232 transitions. [2023-11-10 11:51:02,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 1608 transitions, 28848 flow [2023-11-10 11:51:07,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 636 places, 1608 transitions, 27953 flow, removed 157 selfloop flow, removed 9 redundant places. [2023-11-10 11:51:07,072 INFO L231 Difference]: Finished difference. Result has 642 places, 1391 transitions, 22917 flow [2023-11-10 11:51:07,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=21512, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1050, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=22917, PETRI_PLACES=642, PETRI_TRANSITIONS=1391} [2023-11-10 11:51:07,074 INFO L281 CegarLoopForPetriNet]: 180 programPoint places, 462 predicate places. [2023-11-10 11:51:07,074 INFO L495 AbstractCegarLoop]: Abstraction has has 642 places, 1391 transitions, 22917 flow [2023-11-10 11:51:07,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:51:07,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:51:07,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:51:07,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-10 11:51:07,075 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-10 11:51:07,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:51:07,075 INFO L85 PathProgramCache]: Analyzing trace with hash -360791752, now seen corresponding path program 21 times [2023-11-10 11:51:07,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:51:07,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001806031] [2023-11-10 11:51:07,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:51:07,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:51:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:51:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:51:08,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:51:08,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001806031] [2023-11-10 11:51:08,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001806031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:51:08,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:51:08,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-10 11:51:08,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990155218] [2023-11-10 11:51:08,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:51:08,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-10 11:51:08,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:51:08,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-10 11:51:08,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2023-11-10 11:51:08,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 196 [2023-11-10 11:51:08,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 1391 transitions, 22917 flow. Second operand has 20 states, 20 states have (on average 73.9) internal successors, (1478), 20 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:51:08,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:51:08,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 196 [2023-11-10 11:51:08,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand