/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/weaver/parallel-bakery-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 12:20:15,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 12:20:15,599 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 12:20:15,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 12:20:15,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 12:20:15,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 12:20:15,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 12:20:15,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 12:20:15,636 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 12:20:15,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 12:20:15,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 12:20:15,640 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 12:20:15,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 12:20:15,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 12:20:15,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 12:20:15,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 12:20:15,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 12:20:15,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 12:20:15,643 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 12:20:15,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 12:20:15,643 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 12:20:15,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 12:20:15,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 12:20:15,644 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 12:20:15,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 12:20:15,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:20:15,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 12:20:15,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 12:20:15,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 12:20:15,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 12:20:15,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 12:20:15,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 12:20:15,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 12:20:15,647 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 12:20:15,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 12:20:15,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 12:20:15,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 12:20:15,894 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 12:20:15,895 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 12:20:15,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c [2023-11-10 12:20:17,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 12:20:17,225 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 12:20:17,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c [2023-11-10 12:20:17,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4c89c00/4ba5fe1a12a642e587a25729aca908cf/FLAG264a95a59 [2023-11-10 12:20:17,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea4c89c00/4ba5fe1a12a642e587a25729aca908cf [2023-11-10 12:20:17,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 12:20:17,249 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 12:20:17,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 12:20:17,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 12:20:17,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 12:20:17,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:20:17" (1/1) ... [2023-11-10 12:20:17,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534643ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:17, skipping insertion in model container [2023-11-10 12:20:17,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:20:17" (1/1) ... [2023-11-10 12:20:17,294 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 12:20:17,446 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c[7978,7991] [2023-11-10 12:20:17,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:20:17,458 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 12:20:17,489 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c[7978,7991] [2023-11-10 12:20:17,490 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:20:17,497 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 12:20:17,498 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 12:20:17,503 INFO L206 MainTranslator]: Completed translation [2023-11-10 12:20:17,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:17 WrapperNode [2023-11-10 12:20:17,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 12:20:17,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 12:20:17,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 12:20:17,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 12:20:17,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:17" (1/1) ... [2023-11-10 12:20:17,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:17" (1/1) ... [2023-11-10 12:20:17,547 INFO L138 Inliner]: procedures = 23, calls = 176, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 404 [2023-11-10 12:20:17,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 12:20:17,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 12:20:17,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 12:20:17,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 12:20:17,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:17" (1/1) ... [2023-11-10 12:20:17,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:17" (1/1) ... [2023-11-10 12:20:17,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:17" (1/1) ... [2023-11-10 12:20:17,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:17" (1/1) ... [2023-11-10 12:20:17,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:17" (1/1) ... [2023-11-10 12:20:17,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:17" (1/1) ... [2023-11-10 12:20:17,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:17" (1/1) ... [2023-11-10 12:20:17,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:17" (1/1) ... [2023-11-10 12:20:17,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 12:20:17,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 12:20:17,584 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 12:20:17,584 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 12:20:17,584 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:17" (1/1) ... [2023-11-10 12:20:17,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:20:17,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:20:17,630 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 12:20:17,643 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 12:20:17,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 12:20:17,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-10 12:20:17,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-10 12:20:17,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-10 12:20:17,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-10 12:20:17,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-10 12:20:17,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-10 12:20:17,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-10 12:20:17,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-10 12:20:17,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 12:20:17,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 12:20:17,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 12:20:17,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 12:20:17,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 12:20:17,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 12:20:17,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 12:20:17,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-10 12:20:17,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 12:20:17,684 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 12:20:17,782 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 12:20:17,784 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 12:20:18,158 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 12:20:18,306 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 12:20:18,306 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-10 12:20:18,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:20:18 BoogieIcfgContainer [2023-11-10 12:20:18,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 12:20:18,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 12:20:18,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 12:20:18,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 12:20:18,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:20:17" (1/3) ... [2023-11-10 12:20:18,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42479fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:20:18, skipping insertion in model container [2023-11-10 12:20:18,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:17" (2/3) ... [2023-11-10 12:20:18,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42479fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:20:18, skipping insertion in model container [2023-11-10 12:20:18,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:20:18" (3/3) ... [2023-11-10 12:20:18,320 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-4.wvr.c [2023-11-10 12:20:18,335 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 12:20:18,335 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-10 12:20:18,336 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 12:20:18,450 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-10 12:20:18,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 211 transitions, 450 flow [2023-11-10 12:20:18,587 INFO L124 PetriNetUnfolderBase]: 2/207 cut-off events. [2023-11-10 12:20:18,588 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-10 12:20:18,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 207 events. 2/207 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 199 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2023-11-10 12:20:18,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 211 transitions, 450 flow [2023-11-10 12:20:18,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 194 transitions, 412 flow [2023-11-10 12:20:18,614 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 12:20:18,620 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;@6334f06f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 12:20:18,621 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-10 12:20:18,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 12:20:18,679 INFO L124 PetriNetUnfolderBase]: 2/193 cut-off events. [2023-11-10 12:20:18,679 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-10 12:20:18,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:20:18,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:20:18,680 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 12:20:18,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:20:18,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1394313323, now seen corresponding path program 1 times [2023-11-10 12:20:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:20:18,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918632915] [2023-11-10 12:20:18,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:20:18,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:20:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:20:20,111 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 12:20:20,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:20:20,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918632915] [2023-11-10 12:20:20,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918632915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:20:20,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:20:20,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-10 12:20:20,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689292689] [2023-11-10 12:20:20,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:20:20,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-10 12:20:20,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:20:20,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-10 12:20:20,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2023-11-10 12:20:20,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 211 [2023-11-10 12:20:20,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 194 transitions, 412 flow. Second operand has 15 states, 15 states have (on average 144.4) internal successors, (2166), 15 states have internal predecessors, (2166), 0 states have call successors, (0), 0 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 12:20:20,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:20:20,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 211 [2023-11-10 12:20:20,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:20:29,801 INFO L124 PetriNetUnfolderBase]: 34666/66920 cut-off events. [2023-11-10 12:20:29,801 INFO L125 PetriNetUnfolderBase]: For 7068/7068 co-relation queries the response was YES. [2023-11-10 12:20:30,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120241 conditions, 66920 events. 34666/66920 cut-off events. For 7068/7068 co-relation queries the response was YES. Maximal size of possible extension queue 2079. Compared 702652 event pairs, 17231 based on Foata normal form. 9/66453 useless extension candidates. Maximal degree in co-relation 118632. Up to 23244 conditions per place. [2023-11-10 12:20:30,561 INFO L140 encePairwiseOnDemand]: 189/211 looper letters, 298 selfloop transitions, 31 changer transitions 29/482 dead transitions. [2023-11-10 12:20:30,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 482 transitions, 1851 flow [2023-11-10 12:20:30,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-10 12:20:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-10 12:20:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4008 transitions. [2023-11-10 12:20:30,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7305869485964273 [2023-11-10 12:20:30,587 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4008 transitions. [2023-11-10 12:20:30,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4008 transitions. [2023-11-10 12:20:30,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:20:30,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4008 transitions. [2023-11-10 12:20:30,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 154.15384615384616) internal successors, (4008), 26 states have internal predecessors, (4008), 0 states have call successors, (0), 0 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 12:20:30,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 211.0) internal successors, (5697), 27 states have internal predecessors, (5697), 0 states have call successors, (0), 0 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 12:20:30,627 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 211.0) internal successors, (5697), 27 states have internal predecessors, (5697), 0 states have call successors, (0), 0 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 12:20:30,628 INFO L175 Difference]: Start difference. First operand has 205 places, 194 transitions, 412 flow. Second operand 26 states and 4008 transitions. [2023-11-10 12:20:30,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 482 transitions, 1851 flow [2023-11-10 12:20:30,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 482 transitions, 1737 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-10 12:20:30,928 INFO L231 Difference]: Finished difference. Result has 229 places, 219 transitions, 561 flow [2023-11-10 12:20:30,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=561, PETRI_PLACES=229, PETRI_TRANSITIONS=219} [2023-11-10 12:20:30,934 INFO L281 CegarLoopForPetriNet]: 205 programPoint places, 24 predicate places. [2023-11-10 12:20:30,934 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 219 transitions, 561 flow [2023-11-10 12:20:30,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 144.4) internal successors, (2166), 15 states have internal predecessors, (2166), 0 states have call successors, (0), 0 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 12:20:30,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:20:30,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:20:30,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 12:20:30,939 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 12:20:30,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:20:30,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1409898861, now seen corresponding path program 2 times [2023-11-10 12:20:30,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:20:30,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926009024] [2023-11-10 12:20:30,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:20:30,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:20:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:20:31,154 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 12:20:31,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:20:31,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926009024] [2023-11-10 12:20:31,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926009024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:20:31,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:20:31,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 12:20:31,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950283517] [2023-11-10 12:20:31,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:20:31,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 12:20:31,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:20:31,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 12:20:31,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 12:20:31,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 211 [2023-11-10 12:20:31,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 219 transitions, 561 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 12:20:31,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:20:31,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 211 [2023-11-10 12:20:31,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:20:34,860 INFO L124 PetriNetUnfolderBase]: 17007/35139 cut-off events. [2023-11-10 12:20:34,861 INFO L125 PetriNetUnfolderBase]: For 1292/1297 co-relation queries the response was YES. [2023-11-10 12:20:34,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64144 conditions, 35139 events. 17007/35139 cut-off events. For 1292/1297 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 360253 event pairs, 14025 based on Foata normal form. 418/35053 useless extension candidates. Maximal degree in co-relation 64099. Up to 19729 conditions per place. [2023-11-10 12:20:35,099 INFO L140 encePairwiseOnDemand]: 206/211 looper letters, 60 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2023-11-10 12:20:35,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 240 transitions, 730 flow [2023-11-10 12:20:35,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 12:20:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 12:20:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 566 transitions. [2023-11-10 12:20:35,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8941548183254344 [2023-11-10 12:20:35,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 566 transitions. [2023-11-10 12:20:35,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 566 transitions. [2023-11-10 12:20:35,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:20:35,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 566 transitions. [2023-11-10 12:20:35,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 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 12:20:35,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 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 12:20:35,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 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 12:20:35,105 INFO L175 Difference]: Start difference. First operand has 229 places, 219 transitions, 561 flow. Second operand 3 states and 566 transitions. [2023-11-10 12:20:35,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 240 transitions, 730 flow [2023-11-10 12:20:35,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 240 transitions, 720 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-11-10 12:20:35,131 INFO L231 Difference]: Finished difference. Result has 213 places, 219 transitions, 563 flow [2023-11-10 12:20:35,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=213, PETRI_TRANSITIONS=219} [2023-11-10 12:20:35,132 INFO L281 CegarLoopForPetriNet]: 205 programPoint places, 8 predicate places. [2023-11-10 12:20:35,133 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 219 transitions, 563 flow [2023-11-10 12:20:35,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 12:20:35,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:20:35,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:20:35,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 12:20:35,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 12:20:35,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:20:35,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1521809989, now seen corresponding path program 3 times [2023-11-10 12:20:35,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:20:35,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914786944] [2023-11-10 12:20:35,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:20:35,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:20:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:20:35,427 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 12:20:35,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:20:35,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914786944] [2023-11-10 12:20:35,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914786944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:20:35,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:20:35,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 12:20:35,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284399839] [2023-11-10 12:20:35,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:20:35,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 12:20:35,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:20:35,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 12:20:35,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 12:20:35,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 211 [2023-11-10 12:20:35,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 219 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 12:20:35,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:20:35,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 211 [2023-11-10 12:20:35,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:20:39,059 INFO L124 PetriNetUnfolderBase]: 18261/38310 cut-off events. [2023-11-10 12:20:39,060 INFO L125 PetriNetUnfolderBase]: For 3752/3757 co-relation queries the response was YES. [2023-11-10 12:20:39,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72172 conditions, 38310 events. 18261/38310 cut-off events. For 3752/3757 co-relation queries the response was YES. Maximal size of possible extension queue 1346. Compared 402826 event pairs, 14826 based on Foata normal form. 512/38123 useless extension candidates. Maximal degree in co-relation 65203. Up to 21017 conditions per place. [2023-11-10 12:20:39,325 INFO L140 encePairwiseOnDemand]: 206/211 looper letters, 60 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2023-11-10 12:20:39,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 240 transitions, 736 flow [2023-11-10 12:20:39,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 12:20:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 12:20:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 566 transitions. [2023-11-10 12:20:39,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8941548183254344 [2023-11-10 12:20:39,328 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 566 transitions. [2023-11-10 12:20:39,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 566 transitions. [2023-11-10 12:20:39,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:20:39,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 566 transitions. [2023-11-10 12:20:39,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 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 12:20:39,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 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 12:20:39,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 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 12:20:39,334 INFO L175 Difference]: Start difference. First operand has 213 places, 219 transitions, 563 flow. Second operand 3 states and 566 transitions. [2023-11-10 12:20:39,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 240 transitions, 736 flow [2023-11-10 12:20:39,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 240 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-10 12:20:39,356 INFO L231 Difference]: Finished difference. Result has 214 places, 219 transitions, 571 flow [2023-11-10 12:20:39,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=214, PETRI_TRANSITIONS=219} [2023-11-10 12:20:39,357 INFO L281 CegarLoopForPetriNet]: 205 programPoint places, 9 predicate places. [2023-11-10 12:20:39,358 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 219 transitions, 571 flow [2023-11-10 12:20:39,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 12:20:39,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:20:39,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:20:39,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 12:20:39,359 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 12:20:39,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:20:39,359 INFO L85 PathProgramCache]: Analyzing trace with hash 291075777, now seen corresponding path program 4 times [2023-11-10 12:20:39,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:20:39,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030831397] [2023-11-10 12:20:39,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:20:39,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:20:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:20:40,970 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 12:20:40,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:20:40,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030831397] [2023-11-10 12:20:40,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030831397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:20:40,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:20:40,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-10 12:20:40,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475402600] [2023-11-10 12:20:40,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:20:40,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-10 12:20:40,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:20:40,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-10 12:20:40,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-11-10 12:20:40,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 211 [2023-11-10 12:20:40,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 219 transitions, 571 flow. Second operand has 13 states, 13 states have (on average 151.69230769230768) internal successors, (1972), 13 states have internal predecessors, (1972), 0 states have call successors, (0), 0 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 12:20:40,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:20:40,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 211 [2023-11-10 12:20:40,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:20:47,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([878] L59-->L63: Formula: (not (= (ite (= (mod v_~e2~0_17 256) 0) 1 0) 0)) InVars {~e2~0=v_~e2~0_17} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e2~0=v_~e2~0_17, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][188], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 229#(= ~i~0 0), 210#L111true, 131#L209true, Black: 296#(= ~e2~0 1), 105#L63true, 181#L273-4true, 138#L173true, 294#true, 301#(< ~n3~0 (+ ~n4~0 1)), Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:47,128 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2023-11-10 12:20:47,128 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-10 12:20:47,128 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-10 12:20:47,128 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-10 12:20:47,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L111-->L115: Formula: (not (= (ite (= (mod v_~e1~0_19 256) 0) 1 0) 0)) InVars {~e1~0=v_~e1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][191], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 229#(= ~i~0 0), 131#L209true, Black: 296#(= ~e2~0 1), 34#L59true, 181#L273-4true, 138#L173true, 294#true, 301#(< ~n3~0 (+ ~n4~0 1)), 169#L115true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:47,129 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2023-11-10 12:20:47,129 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-10 12:20:47,129 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-10 12:20:47,129 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-10 12:20:48,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([878] L59-->L63: Formula: (not (= (ite (= (mod v_~e2~0_17 256) 0) 1 0) 0)) InVars {~e2~0=v_~e2~0_17} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e2~0=v_~e2~0_17, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][199], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 229#(= ~i~0 0), 302#(<= (+ ~n3~0 1) ~n4~0), 164#L212true, 210#L111true, Black: 296#(= ~e2~0 1), 105#L63true, 181#L273-4true, 138#L173true, 294#true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:48,246 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,247 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,247 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,247 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L111-->L115: Formula: (not (= (ite (= (mod v_~e1~0_19 256) 0) 1 0) 0)) InVars {~e1~0=v_~e1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][205], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 229#(= ~i~0 0), 302#(<= (+ ~n3~0 1) ~n4~0), 164#L212true, Black: 296#(= ~e2~0 1), 34#L59true, 181#L273-4true, 138#L173true, 294#true, 169#L115true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:48,247 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,247 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,247 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,247 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([878] L59-->L63: Formula: (not (= (ite (= (mod v_~e2~0_17 256) 0) 1 0) 0)) InVars {~e2~0=v_~e2~0_17} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e2~0=v_~e2~0_17, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][188], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 32#L176true, 229#(= ~i~0 0), 210#L111true, 131#L209true, Black: 296#(= ~e2~0 1), 105#L63true, 181#L273-4true, 301#(< ~n3~0 (+ ~n4~0 1)), 294#true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:48,248 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,248 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,248 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,248 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L111-->L115: Formula: (not (= (ite (= (mod v_~e1~0_19 256) 0) 1 0) 0)) InVars {~e1~0=v_~e1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][191], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 32#L176true, 229#(= ~i~0 0), 131#L209true, Black: 296#(= ~e2~0 1), 34#L59true, 181#L273-4true, 294#true, 301#(< ~n3~0 (+ ~n4~0 1)), 169#L115true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:48,248 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,248 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,248 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-10 12:20:48,248 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-10 12:20:49,281 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([878] L59-->L63: Formula: (not (= (ite (= (mod v_~e2~0_17 256) 0) 1 0) 0)) InVars {~e2~0=v_~e2~0_17} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e2~0=v_~e2~0_17, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][199], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 32#L176true, 229#(= ~i~0 0), 302#(<= (+ ~n3~0 1) ~n4~0), 164#L212true, 210#L111true, Black: 296#(= ~e2~0 1), 105#L63true, 181#L273-4true, 294#true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:49,282 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,282 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,282 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,282 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L111-->L115: Formula: (not (= (ite (= (mod v_~e1~0_19 256) 0) 1 0) 0)) InVars {~e1~0=v_~e1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][205], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 32#L176true, 229#(= ~i~0 0), 302#(<= (+ ~n3~0 1) ~n4~0), 164#L212true, Black: 296#(= ~e2~0 1), 34#L59true, 181#L273-4true, 294#true, 169#L115true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:49,282 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,282 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,282 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,282 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([878] L59-->L63: Formula: (not (= (ite (= (mod v_~e2~0_17 256) 0) 1 0) 0)) InVars {~e2~0=v_~e2~0_17} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e2~0=v_~e2~0_17, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][188], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 229#(= ~i~0 0), 210#L111true, 131#L209true, Black: 296#(= ~e2~0 1), 105#L63true, 181#L273-4true, 301#(< ~n3~0 (+ ~n4~0 1)), 294#true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), 168#L179true, Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:49,283 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,283 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,283 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,283 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L111-->L115: Formula: (not (= (ite (= (mod v_~e1~0_19 256) 0) 1 0) 0)) InVars {~e1~0=v_~e1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][191], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 229#(= ~i~0 0), 131#L209true, Black: 296#(= ~e2~0 1), 34#L59true, 181#L273-4true, 294#true, 301#(< ~n3~0 (+ ~n4~0 1)), 169#L115true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), 168#L179true, Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:49,283 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,283 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,283 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-10 12:20:49,283 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-10 12:20:50,426 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([878] L59-->L63: Formula: (not (= (ite (= (mod v_~e2~0_17 256) 0) 1 0) 0)) InVars {~e2~0=v_~e2~0_17} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e2~0=v_~e2~0_17, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][199], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 302#(<= (+ ~n3~0 1) ~n4~0), 229#(= ~i~0 0), 164#L212true, 210#L111true, Black: 296#(= ~e2~0 1), 105#L63true, 181#L273-4true, 294#true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), 168#L179true, Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:50,426 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,427 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,427 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,427 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,427 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L111-->L115: Formula: (not (= (ite (= (mod v_~e1~0_19 256) 0) 1 0) 0)) InVars {~e1~0=v_~e1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][205], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 229#(= ~i~0 0), 302#(<= (+ ~n3~0 1) ~n4~0), 164#L212true, Black: 296#(= ~e2~0 1), 34#L59true, 181#L273-4true, 294#true, 169#L115true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), 168#L179true, Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:50,427 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,427 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,427 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,427 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([878] L59-->L63: Formula: (not (= (ite (= (mod v_~e2~0_17 256) 0) 1 0) 0)) InVars {~e2~0=v_~e2~0_17} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e2~0=v_~e2~0_17, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][188], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 229#(= ~i~0 0), 210#L111true, 131#L209true, Black: 296#(= ~e2~0 1), 105#L63true, 181#L273-4true, 301#(< ~n3~0 (+ ~n4~0 1)), 294#true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), 64#L182true, Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:50,428 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,428 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,428 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,428 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L111-->L115: Formula: (not (= (ite (= (mod v_~e1~0_19 256) 0) 1 0) 0)) InVars {~e1~0=v_~e1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][191], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 229#(= ~i~0 0), 131#L209true, Black: 296#(= ~e2~0 1), 34#L59true, 181#L273-4true, 301#(< ~n3~0 (+ ~n4~0 1)), 294#true, 169#L115true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), 64#L182true, Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:50,428 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,428 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,428 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-10 12:20:50,429 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-10 12:20:51,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([878] L59-->L63: Formula: (not (= (ite (= (mod v_~e2~0_17 256) 0) 1 0) 0)) InVars {~e2~0=v_~e2~0_17} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e2~0=v_~e2~0_17, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][199], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 302#(<= (+ ~n3~0 1) ~n4~0), 229#(= ~i~0 0), 164#L212true, 210#L111true, Black: 296#(= ~e2~0 1), 105#L63true, 181#L273-4true, 294#true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), 64#L182true, Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:51,543 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2023-11-10 12:20:51,543 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-10 12:20:51,543 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-10 12:20:51,543 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-10 12:20:51,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L111-->L115: Formula: (not (= (ite (= (mod v_~e1~0_19 256) 0) 1 0) 0)) InVars {~e1~0=v_~e1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][205], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), Black: 291#(= ~e1~0 1), 229#(= ~i~0 0), 302#(<= (+ ~n3~0 1) ~n4~0), 164#L212true, Black: 296#(= ~e2~0 1), 34#L59true, 181#L273-4true, 294#true, 169#L115true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), 64#L182true, Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:51,543 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2023-11-10 12:20:51,543 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-10 12:20:51,543 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-10 12:20:51,543 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-10 12:20:54,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([878] L59-->L63: Formula: (not (= (ite (= (mod v_~e2~0_17 256) 0) 1 0) 0)) InVars {~e2~0=v_~e2~0_17} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e2~0=v_~e2~0_17, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][95], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), 299#true, Black: 291#(= ~e1~0 1), 210#L111true, 131#L209true, Black: 296#(= ~e2~0 1), 105#L63true, 225#true, 4#L192true, 181#L273-4true, 294#true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), Black: 229#(= ~i~0 0), Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:54,274 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2023-11-10 12:20:54,274 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-10 12:20:54,275 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-10 12:20:54,275 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-10 12:20:54,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L111-->L115: Formula: (not (= (ite (= (mod v_~e1~0_19 256) 0) 1 0) 0)) InVars {~e1~0=v_~e1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][116], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), 299#true, Black: 291#(= ~e1~0 1), 131#L209true, Black: 296#(= ~e2~0 1), 225#true, 34#L59true, 4#L192true, 181#L273-4true, 294#true, 169#L115true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), Black: 229#(= ~i~0 0), Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:54,275 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2023-11-10 12:20:54,275 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-10 12:20:54,275 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-10 12:20:54,275 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-10 12:20:55,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([878] L59-->L63: Formula: (not (= (ite (= (mod v_~e2~0_17 256) 0) 1 0) 0)) InVars {~e2~0=v_~e2~0_17} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e2~0=v_~e2~0_17, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][95], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), 299#true, Black: 291#(= ~e1~0 1), 164#L212true, 210#L111true, Black: 296#(= ~e2~0 1), 105#L63true, 225#true, 4#L192true, 181#L273-4true, 294#true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), Black: 229#(= ~i~0 0), Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:55,691 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2023-11-10 12:20:55,692 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-10 12:20:55,692 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-10 12:20:55,692 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-10 12:20:55,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L111-->L115: Formula: (not (= (ite (= (mod v_~e1~0_19 256) 0) 1 0) 0)) InVars {~e1~0=v_~e1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][116], [Black: 258#(and (= 2 ~i3~0) (= 3 ~i~0) (= ~i1~0 1) (= ~i2~0 0)), 299#true, Black: 291#(= ~e1~0 1), 164#L212true, Black: 296#(= ~e2~0 1), 225#true, 34#L59true, 4#L192true, 181#L273-4true, 294#true, 169#L115true, Black: 248#(and (= ~i2~0 0) (= ~i~0 1)), Black: 229#(= ~i~0 0), Black: 252#(and (= 2 ~i~0) (= ~i1~0 1) (= ~i2~0 0))]) [2023-11-10 12:20:55,692 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2023-11-10 12:20:55,692 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-10 12:20:55,692 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-10 12:20:55,692 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-10 12:21:23,423 INFO L124 PetriNetUnfolderBase]: 216553/367915 cut-off events. [2023-11-10 12:21:23,424 INFO L125 PetriNetUnfolderBase]: For 43895/43968 co-relation queries the response was YES. [2023-11-10 12:21:25,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751931 conditions, 367915 events. 216553/367915 cut-off events. For 43895/43968 co-relation queries the response was YES. Maximal size of possible extension queue 9135. Compared 3975544 event pairs, 74681 based on Foata normal form. 215/361971 useless extension candidates. Maximal degree in co-relation 640162. Up to 130481 conditions per place. [2023-11-10 12:21:26,350 INFO L140 encePairwiseOnDemand]: 186/211 looper letters, 485 selfloop transitions, 120 changer transitions 0/763 dead transitions. [2023-11-10 12:21:26,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 763 transitions, 3070 flow [2023-11-10 12:21:26,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-10 12:21:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-10 12:21:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3696 transitions. [2023-11-10 12:21:26,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8341232227488151 [2023-11-10 12:21:26,359 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3696 transitions. [2023-11-10 12:21:26,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3696 transitions. [2023-11-10 12:21:26,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:21:26,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3696 transitions. [2023-11-10 12:21:26,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 176.0) internal successors, (3696), 21 states have internal predecessors, (3696), 0 states have call successors, (0), 0 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 12:21:26,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 211.0) internal successors, (4642), 22 states have internal predecessors, (4642), 0 states have call successors, (0), 0 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 12:21:26,376 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 211.0) internal successors, (4642), 22 states have internal predecessors, (4642), 0 states have call successors, (0), 0 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 12:21:26,376 INFO L175 Difference]: Start difference. First operand has 214 places, 219 transitions, 571 flow. Second operand 21 states and 3696 transitions. [2023-11-10 12:21:26,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 763 transitions, 3070 flow [2023-11-10 12:21:26,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 763 transitions, 3066 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-10 12:21:26,700 INFO L231 Difference]: Finished difference. Result has 250 places, 342 transitions, 1367 flow [2023-11-10 12:21:26,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1367, PETRI_PLACES=250, PETRI_TRANSITIONS=342} [2023-11-10 12:21:26,701 INFO L281 CegarLoopForPetriNet]: 205 programPoint places, 45 predicate places. [2023-11-10 12:21:26,701 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 342 transitions, 1367 flow [2023-11-10 12:21:26,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 151.69230769230768) internal successors, (1972), 13 states have internal predecessors, (1972), 0 states have call successors, (0), 0 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 12:21:26,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:21:26,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:21:26,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 12:21:26,702 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 12:21:26,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:21:26,703 INFO L85 PathProgramCache]: Analyzing trace with hash -247909399, now seen corresponding path program 5 times [2023-11-10 12:21:26,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:21:26,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592639865] [2023-11-10 12:21:26,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:21:26,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:21:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:21:26,865 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 12:21:26,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:21:26,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592639865] [2023-11-10 12:21:26,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592639865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:21:26,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:21:26,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 12:21:26,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528594671] [2023-11-10 12:21:26,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:21:26,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 12:21:26,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:21:26,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 12:21:26,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 12:21:26,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 211 [2023-11-10 12:21:26,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 342 transitions, 1367 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 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 12:21:26,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:21:26,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 211 [2023-11-10 12:21:26,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand