/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:10:20,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:10:20,559 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-12-09 15:10:20,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:10:20,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:10:20,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:10:20,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:10:20,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:10:20,591 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:10:20,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:10:20,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:10:20,592 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:10:20,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:10:20,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:10:20,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:10:20,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:10:20,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:10:20,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:10:20,593 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:10:20,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:10:20,594 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:10:20,597 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:10:20,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:10:20,597 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:10:20,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:10:20,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:10:20,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:10:20,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:10:20,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:10:20,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:10:20,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:10:20,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:10:20,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:10:20,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:10:20,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:10:20,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:10:20,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:10:20,807 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:10:20,807 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:10:20,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c [2023-12-09 15:10:21,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:10:22,086 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:10:22,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c [2023-12-09 15:10:22,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/840bf6ef0/1389f2757190430db290e0c481dead89/FLAG68c9b95c6 [2023-12-09 15:10:22,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/840bf6ef0/1389f2757190430db290e0c481dead89 [2023-12-09 15:10:22,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:10:22,112 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:10:22,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:10:22,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:10:22,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:10:22,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:10:22" (1/1) ... [2023-12-09 15:10:22,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350129eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:22, skipping insertion in model container [2023-12-09 15:10:22,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:10:22" (1/1) ... [2023-12-09 15:10:22,151 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:10:22,266 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/chl-name-comparator-trans.wvr.c[4827,4840] [2023-12-09 15:10:22,280 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:10:22,287 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:10:22,306 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/chl-name-comparator-trans.wvr.c[4827,4840] [2023-12-09 15:10:22,320 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:10:22,335 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:10:22,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:22 WrapperNode [2023-12-09 15:10:22,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:10:22,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:10:22,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:10:22,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:10:22,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:22" (1/1) ... [2023-12-09 15:10:22,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:22" (1/1) ... [2023-12-09 15:10:22,376 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 319 [2023-12-09 15:10:22,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:10:22,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:10:22,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:10:22,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:10:22,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:22" (1/1) ... [2023-12-09 15:10:22,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:22" (1/1) ... [2023-12-09 15:10:22,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:22" (1/1) ... [2023-12-09 15:10:22,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:22" (1/1) ... [2023-12-09 15:10:22,411 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:22" (1/1) ... [2023-12-09 15:10:22,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:22" (1/1) ... [2023-12-09 15:10:22,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:22" (1/1) ... [2023-12-09 15:10:22,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:22" (1/1) ... [2023-12-09 15:10:22,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:10:22,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:10:22,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:10:22,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:10:22,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:22" (1/1) ... [2023-12-09 15:10:22,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:10:22,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:10:22,477 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-12-09 15:10:22,497 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-12-09 15:10:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:10:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:10:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:10:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:10:22,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:10:22,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:10:22,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:10:22,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:10:22,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:10:22,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:10:22,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:10:22,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:10:22,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:10:22,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:10:22,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:10:22,508 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:10:22,593 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:10:22,595 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:10:22,911 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:10:22,924 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:10:22,924 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-09 15:10:22,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:10:22 BoogieIcfgContainer [2023-12-09 15:10:22,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:10:22,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:10:22,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:10:22,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:10:22,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:10:22" (1/3) ... [2023-12-09 15:10:22,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f27c338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:10:22, skipping insertion in model container [2023-12-09 15:10:22,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:10:22" (2/3) ... [2023-12-09 15:10:22,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f27c338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:10:22, skipping insertion in model container [2023-12-09 15:10:22,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:10:22" (3/3) ... [2023-12-09 15:10:22,931 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2023-12-09 15:10:22,942 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:10:22,942 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:10:22,942 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:10:23,020 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:10:23,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 378 places, 394 transitions, 809 flow [2023-12-09 15:10:23,184 INFO L124 PetriNetUnfolderBase]: 26/391 cut-off events. [2023-12-09 15:10:23,184 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:10:23,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 391 events. 26/391 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 919 event pairs, 0 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 291. Up to 2 conditions per place. [2023-12-09 15:10:23,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 378 places, 394 transitions, 809 flow [2023-12-09 15:10:23,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 364 places, 380 transitions, 778 flow [2023-12-09 15:10:23,234 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:10:23,239 INFO L362 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=true, 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;@4ddd8538, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:10:23,239 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:10:23,307 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:10:23,307 INFO L124 PetriNetUnfolderBase]: 26/379 cut-off events. [2023-12-09 15:10:23,307 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:10:23,308 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:23,309 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:10:23,309 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:10:23,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1237423684, now seen corresponding path program 1 times [2023-12-09 15:10:23,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:23,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671503590] [2023-12-09 15:10:23,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:23,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:10:23,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671503590] [2023-12-09 15:10:23,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671503590] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:23,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:23,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 15:10:23,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226496539] [2023-12-09 15:10:23,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:23,642 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 15:10:23,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:23,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 15:10:23,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 15:10:23,678 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 394 [2023-12-09 15:10:23,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 380 transitions, 778 flow. Second operand has 2 states, 2 states have (on average 372.5) internal successors, (745), 2 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:23,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:23,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 394 [2023-12-09 15:10:23,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:23,765 INFO L124 PetriNetUnfolderBase]: 7/361 cut-off events. [2023-12-09 15:10:23,765 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2023-12-09 15:10:23,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 361 events. 7/361 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 866 event pairs, 0 based on Foata normal form. 38/377 useless extension candidates. Maximal degree in co-relation 280. Up to 7 conditions per place. [2023-12-09 15:10:23,772 INFO L140 encePairwiseOnDemand]: 375/394 looper letters, 6 selfloop transitions, 0 changer transitions 3/361 dead transitions. [2023-12-09 15:10:23,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 361 transitions, 752 flow [2023-12-09 15:10:23,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 15:10:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 15:10:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 761 transitions. [2023-12-09 15:10:23,786 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9657360406091371 [2023-12-09 15:10:23,786 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 761 transitions. [2023-12-09 15:10:23,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 761 transitions. [2023-12-09 15:10:23,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:23,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 761 transitions. [2023-12-09 15:10:23,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 380.5) internal successors, (761), 2 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:23,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:23,800 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:23,803 INFO L308 CegarLoopForPetriNet]: 364 programPoint places, 1 predicate places. [2023-12-09 15:10:23,803 INFO L500 AbstractCegarLoop]: Abstraction has has 365 places, 361 transitions, 752 flow [2023-12-09 15:10:23,804 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 372.5) internal successors, (745), 2 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:23,804 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:23,805 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:10:23,805 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:10:23,805 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:10:23,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:23,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1286916208, now seen corresponding path program 1 times [2023-12-09 15:10:23,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:23,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288090321] [2023-12-09 15:10:23,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:23,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:10:24,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288090321] [2023-12-09 15:10:24,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288090321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:24,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:24,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:10:24,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372411159] [2023-12-09 15:10:24,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:24,171 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:10:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:10:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:10:24,174 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 394 [2023-12-09 15:10:24,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 361 transitions, 752 flow. Second operand has 5 states, 5 states have (on average 356.4) internal successors, (1782), 5 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:24,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:24,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 394 [2023-12-09 15:10:24,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:24,328 INFO L124 PetriNetUnfolderBase]: 7/368 cut-off events. [2023-12-09 15:10:24,328 INFO L125 PetriNetUnfolderBase]: For 29/37 co-relation queries the response was YES. [2023-12-09 15:10:24,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 368 events. 7/368 cut-off events. For 29/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 865 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 308. Up to 11 conditions per place. [2023-12-09 15:10:24,331 INFO L140 encePairwiseOnDemand]: 387/394 looper letters, 19 selfloop transitions, 6 changer transitions 3/365 dead transitions. [2023-12-09 15:10:24,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 365 transitions, 810 flow [2023-12-09 15:10:24,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:10:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:10:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1791 transitions. [2023-12-09 15:10:24,336 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9091370558375634 [2023-12-09 15:10:24,336 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1791 transitions. [2023-12-09 15:10:24,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1791 transitions. [2023-12-09 15:10:24,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:24,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1791 transitions. [2023-12-09 15:10:24,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 358.2) internal successors, (1791), 5 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:24,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:24,344 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:24,344 INFO L308 CegarLoopForPetriNet]: 364 programPoint places, 5 predicate places. [2023-12-09 15:10:24,344 INFO L500 AbstractCegarLoop]: Abstraction has has 369 places, 365 transitions, 810 flow [2023-12-09 15:10:24,345 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 356.4) internal successors, (1782), 5 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:24,345 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:24,346 INFO L233 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, 1, 1, 1, 1, 1, 1, 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-12-09 15:10:24,346 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:10:24,346 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:10:24,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:24,347 INFO L85 PathProgramCache]: Analyzing trace with hash -331274696, now seen corresponding path program 1 times [2023-12-09 15:10:24,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:24,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995905619] [2023-12-09 15:10:24,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:24,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:10:24,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:24,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995905619] [2023-12-09 15:10:24,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995905619] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:10:24,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577592396] [2023-12-09 15:10:24,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:24,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:10:24,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:10:24,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:10:24,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-09 15:10:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:24,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:10:24,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:10:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:10:24,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:10:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:10:24,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577592396] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:10:24,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:10:24,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-12-09 15:10:24,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412130326] [2023-12-09 15:10:24,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:10:24,942 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-09 15:10:24,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:24,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-09 15:10:24,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:10:24,947 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 394 [2023-12-09 15:10:24,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 365 transitions, 810 flow. Second operand has 14 states, 14 states have (on average 355.0) internal successors, (4970), 14 states have internal predecessors, (4970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:24,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:24,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 394 [2023-12-09 15:10:24,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:25,131 INFO L124 PetriNetUnfolderBase]: 7/378 cut-off events. [2023-12-09 15:10:25,131 INFO L125 PetriNetUnfolderBase]: For 66/80 co-relation queries the response was YES. [2023-12-09 15:10:25,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 378 events. 7/378 cut-off events. For 66/80 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 856 event pairs, 0 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 352. Up to 16 conditions per place. [2023-12-09 15:10:25,135 INFO L140 encePairwiseOnDemand]: 384/394 looper letters, 20 selfloop transitions, 13 changer transitions 3/372 dead transitions. [2023-12-09 15:10:25,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 372 transitions, 900 flow [2023-12-09 15:10:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:10:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:10:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3907 transitions. [2023-12-09 15:10:25,141 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9014766958929396 [2023-12-09 15:10:25,141 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3907 transitions. [2023-12-09 15:10:25,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3907 transitions. [2023-12-09 15:10:25,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:25,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3907 transitions. [2023-12-09 15:10:25,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 355.1818181818182) internal successors, (3907), 11 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:25,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 394.0) internal successors, (4728), 12 states have internal predecessors, (4728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:25,155 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 394.0) internal successors, (4728), 12 states have internal predecessors, (4728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:25,156 INFO L308 CegarLoopForPetriNet]: 364 programPoint places, 15 predicate places. [2023-12-09 15:10:25,157 INFO L500 AbstractCegarLoop]: Abstraction has has 379 places, 372 transitions, 900 flow [2023-12-09 15:10:25,160 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 355.0) internal successors, (4970), 14 states have internal predecessors, (4970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:25,160 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:25,161 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:10:25,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-09 15:10:25,365 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:10:25,369 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:10:25,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:25,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1060301882, now seen corresponding path program 2 times [2023-12-09 15:10:25,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:25,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779864292] [2023-12-09 15:10:25,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:25,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:25,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:25,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779864292] [2023-12-09 15:10:25,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779864292] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:10:25,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:10:25,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:10:25,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275625606] [2023-12-09 15:10:25,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:10:25,708 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:10:25,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:25,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:10:25,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:10:25,712 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 394 [2023-12-09 15:10:25,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 372 transitions, 900 flow. Second operand has 9 states, 9 states have (on average 317.8888888888889) internal successors, (2861), 9 states have internal predecessors, (2861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:25,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:25,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 394 [2023-12-09 15:10:25,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:10:27,217 INFO L124 PetriNetUnfolderBase]: 2368/9311 cut-off events. [2023-12-09 15:10:27,217 INFO L125 PetriNetUnfolderBase]: For 3917/3917 co-relation queries the response was YES. [2023-12-09 15:10:27,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14499 conditions, 9311 events. 2368/9311 cut-off events. For 3917/3917 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 102794 event pairs, 815 based on Foata normal form. 0/8525 useless extension candidates. Maximal degree in co-relation 13676. Up to 1396 conditions per place. [2023-12-09 15:10:27,293 INFO L140 encePairwiseOnDemand]: 375/394 looper letters, 128 selfloop transitions, 14 changer transitions 9/462 dead transitions. [2023-12-09 15:10:27,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 462 transitions, 1526 flow [2023-12-09 15:10:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-09 15:10:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-09 15:10:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3908 transitions. [2023-12-09 15:10:27,299 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8265651438240271 [2023-12-09 15:10:27,299 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3908 transitions. [2023-12-09 15:10:27,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3908 transitions. [2023-12-09 15:10:27,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:10:27,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3908 transitions. [2023-12-09 15:10:27,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 325.6666666666667) internal successors, (3908), 12 states have internal predecessors, (3908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:27,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 394.0) internal successors, (5122), 13 states have internal predecessors, (5122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:27,312 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 394.0) internal successors, (5122), 13 states have internal predecessors, (5122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:27,314 INFO L308 CegarLoopForPetriNet]: 364 programPoint places, 26 predicate places. [2023-12-09 15:10:27,314 INFO L500 AbstractCegarLoop]: Abstraction has has 390 places, 462 transitions, 1526 flow [2023-12-09 15:10:27,315 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 317.8888888888889) internal successors, (2861), 9 states have internal predecessors, (2861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:27,315 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:10:27,315 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:10:27,315 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:10:27,316 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:10:27,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:10:27,316 INFO L85 PathProgramCache]: Analyzing trace with hash -357144375, now seen corresponding path program 1 times [2023-12-09 15:10:27,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:10:27,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121893085] [2023-12-09 15:10:27,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:27,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:10:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:27,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:10:27,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121893085] [2023-12-09 15:10:27,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121893085] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:10:27,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657363477] [2023-12-09 15:10:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:10:27,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:10:27,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:10:27,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:10:27,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-09 15:10:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:10:28,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-09 15:10:28,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:10:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:28,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:10:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-09 15:10:28,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657363477] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:10:28,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:10:28,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 13] total 26 [2023-12-09 15:10:28,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795662937] [2023-12-09 15:10:28,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:10:28,918 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-09 15:10:28,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:10:28,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-09 15:10:28,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2023-12-09 15:10:28,924 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 394 [2023-12-09 15:10:28,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 462 transitions, 1526 flow. Second operand has 26 states, 26 states have (on average 291.6923076923077) internal successors, (7584), 26 states have internal predecessors, (7584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:10:28,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:10:28,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 394 [2023-12-09 15:10:28,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:35,439 INFO L124 PetriNetUnfolderBase]: 113742/380038 cut-off events. [2023-12-09 15:11:35,440 INFO L125 PetriNetUnfolderBase]: For 156279/240021 co-relation queries the response was YES. [2023-12-09 15:11:38,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660608 conditions, 380038 events. 113742/380038 cut-off events. For 156279/240021 co-relation queries the response was YES. Maximal size of possible extension queue 9986. Compared 6583675 event pairs, 9894 based on Foata normal form. 606/346364 useless extension candidates. Maximal degree in co-relation 652423. Up to 35715 conditions per place. [2023-12-09 15:11:39,855 INFO L140 encePairwiseOnDemand]: 346/394 looper letters, 3020 selfloop transitions, 1264 changer transitions 366/4946 dead transitions. [2023-12-09 15:11:39,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 4946 transitions, 27754 flow [2023-12-09 15:11:39,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2023-12-09 15:11:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2023-12-09 15:11:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 49850 transitions. [2023-12-09 15:11:39,908 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7810052014789748 [2023-12-09 15:11:39,909 INFO L72 ComplementDD]: Start complementDD. Operand 162 states and 49850 transitions. [2023-12-09 15:11:39,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 49850 transitions. [2023-12-09 15:11:39,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:11:39,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 162 states and 49850 transitions. [2023-12-09 15:11:40,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 163 states, 162 states have (on average 307.71604938271605) internal successors, (49850), 162 states have internal predecessors, (49850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:40,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 163 states, 163 states have (on average 394.0) internal successors, (64222), 163 states have internal predecessors, (64222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:40,202 INFO L81 ComplementDD]: Finished complementDD. Result has 163 states, 163 states have (on average 394.0) internal successors, (64222), 163 states have internal predecessors, (64222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:40,205 INFO L308 CegarLoopForPetriNet]: 364 programPoint places, 187 predicate places. [2023-12-09 15:11:40,205 INFO L500 AbstractCegarLoop]: Abstraction has has 551 places, 4946 transitions, 27754 flow [2023-12-09 15:11:40,206 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 291.6923076923077) internal successors, (7584), 26 states have internal predecessors, (7584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:40,207 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:11:40,207 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:11:40,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-09 15:11:40,412 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:11:40,413 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:11:40,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:11:40,413 INFO L85 PathProgramCache]: Analyzing trace with hash 736076107, now seen corresponding path program 2 times [2023-12-09 15:11:40,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:11:40,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076400945] [2023-12-09 15:11:40,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:11:40,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:11:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:11:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-09 15:11:40,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:11:40,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076400945] [2023-12-09 15:11:40,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076400945] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:11:40,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:11:40,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:11:40,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572096916] [2023-12-09 15:11:40,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:11:40,688 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:11:40,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:11:40,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:11:40,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:11:40,691 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 394 [2023-12-09 15:11:40,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 4946 transitions, 27754 flow. Second operand has 9 states, 9 states have (on average 318.1111111111111) internal successors, (2863), 9 states have internal predecessors, (2863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:11:40,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:11:40,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 394 [2023-12-09 15:11:40,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:11:45,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1043] L93-->L94: Formula: (= v_~result_12~0_3 (ite (= v_~name_1~0_7 v_~name_3~0_7) 0 v_~result_12~0_4)) InVars {~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_4, ~name_1~0=v_~name_1~0_7} OutVars{~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_3, ~name_1~0=v_~name_1~0_7} AuxVars[] AssignedVars[~result_12~0][2225], [130#L94true, 394#true, 3620#(= ~result_8~0 0), 25#L38-1true, 3347#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (not (= ~name_2~0 ~name_1~0))) (= ~break_15~0 0)), 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:11:45,433 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2023-12-09 15:11:45,433 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2023-12-09 15:11:45,433 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2023-12-09 15:11:45,433 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2023-12-09 15:12:16,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1043] L93-->L94: Formula: (= v_~result_12~0_3 (ite (= v_~name_1~0_7 v_~name_3~0_7) 0 v_~result_12~0_4)) InVars {~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_4, ~name_1~0=v_~name_1~0_7} OutVars{~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_3, ~name_1~0=v_~name_1~0_7} AuxVars[] AssignedVars[~result_12~0][627], [130#L94true, 394#true, 25#L38-1true, 381#true, 3347#(and (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (not (= ~name_2~0 ~name_1~0))) (= ~break_15~0 0)), 15#L136-4true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:12:16,973 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2023-12-09 15:12:16,973 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-12-09 15:12:16,973 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-12-09 15:12:16,973 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-12-09 15:12:17,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1043] L93-->L94: Formula: (= v_~result_12~0_3 (ite (= v_~name_1~0_7 v_~name_3~0_7) 0 v_~result_12~0_4)) InVars {~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_4, ~name_1~0=v_~name_1~0_7} OutVars{~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_3, ~name_1~0=v_~name_1~0_7} AuxVars[] AssignedVars[~result_12~0][324], [130#L94true, 394#true, 1765#(= ~break_15~0 0), 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, 371#L37-1true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:12:17,038 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2023-12-09 15:12:17,038 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-12-09 15:12:17,038 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-12-09 15:12:17,038 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-12-09 15:12:18,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][362], [1763#true, 104#L96-5true, 394#true, 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, 135#L38-3true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:12:18,095 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2023-12-09 15:12:18,095 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-12-09 15:12:18,096 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-12-09 15:12:18,096 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-12-09 15:12:20,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1043] L93-->L94: Formula: (= v_~result_12~0_3 (ite (= v_~name_1~0_7 v_~name_3~0_7) 0 v_~result_12~0_4)) InVars {~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_4, ~name_1~0=v_~name_1~0_7} OutVars{~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_3, ~name_1~0=v_~name_1~0_7} AuxVars[] AssignedVars[~result_12~0][324], [130#L94true, 394#true, 1765#(= ~break_15~0 0), 381#true, 15#L136-4true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0)), 256#L54-2true]) [2023-12-09 15:12:20,731 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2023-12-09 15:12:20,731 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:20,731 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:20,731 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:21,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][5978], [1739#true, 104#L96-5true, 394#true, 3620#(= ~result_8~0 0), 381#true, 15#L136-4true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, 371#L37-1true, thread1Thread1of1ForFork1InUse, 3453#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~break_7~0 0))) (or (= ~break_15~0 1) (and (= ~break_15~0 0) (or (= ~break_11~0 1) (= ~break_11~0 0)))) (or (and (= ~break_15~0 0) (not (= ~name_3~0 ~name_1~0))) (= ~break_11~0 0)))]) [2023-12-09 15:12:21,736 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2023-12-09 15:12:21,737 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:21,737 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:21,737 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:21,850 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][699], [104#L96-5true, 2725#(or (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~break_7~0 0) (= ~break_11~0 0)), 394#true, 344#L38-4true, 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:12:21,851 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2023-12-09 15:12:21,851 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:21,851 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:21,855 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:21,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][362], [1763#true, 308#L37-3true, 104#L96-5true, 394#true, 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:12:21,858 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2023-12-09 15:12:21,858 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:21,858 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:21,858 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:22,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][654], [104#L96-5true, 394#true, 3316#(and (or (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~break_7~0 0) (= ~break_11~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_15~0 0) (= ~break_7~0 0) (= ~break_11~0 0))), 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true, 121#L38true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:12:22,204 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is not cut-off event [2023-12-09 15:12:22,204 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is not cut-off event [2023-12-09 15:12:22,204 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is not cut-off event [2023-12-09 15:12:22,204 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is not cut-off event [2023-12-09 15:12:22,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][709], [104#L96-5true, 394#true, 2715#(or (= ~break_15~0 0) (= ~break_7~0 0) (= ~break_11~0 0)), 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, 371#L37-1true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:12:22,209 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2023-12-09 15:12:22,209 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:22,209 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:22,213 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:22,215 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][654], [104#L96-5true, 394#true, 3316#(and (or (= ~break_15~0 0) (= |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= ~break_7~0 0) (= ~break_11~0 0)) (or (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_15~0 0) (= ~break_7~0 0) (= ~break_11~0 0))), 25#L38-1true, 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:12:22,216 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2023-12-09 15:12:22,216 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:22,216 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:22,216 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2023-12-09 15:12:24,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1043] L93-->L94: Formula: (= v_~result_12~0_3 (ite (= v_~name_1~0_7 v_~name_3~0_7) 0 v_~result_12~0_4)) InVars {~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_4, ~name_1~0=v_~name_1~0_7} OutVars{~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_3, ~name_1~0=v_~name_1~0_7} AuxVars[] AssignedVars[~result_12~0][324], [130#L94true, 394#true, 1765#(= ~break_15~0 0), 381#true, 15#L136-4true, thread3Thread1of1ForFork0InUse, 175#L85-12true, 7#L55true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:12:24,473 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2023-12-09 15:12:24,473 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:12:24,473 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:12:24,473 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:12:25,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][6161], [3557#(and (or (and (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (= ~break_7~0 0)) (= |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (or (= ~break_15~0 1) (and (= ~break_15~0 0) (or (= ~break_11~0 1) (= ~break_11~0 0)))) (or (and (= ~break_15~0 0) (not (= ~name_3~0 ~name_1~0))) (= ~break_11~0 0))), 1739#true, 104#L96-5true, 394#true, 3620#(= ~result_8~0 0), 381#true, 15#L136-4true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 256#L54-2true]) [2023-12-09 15:12:25,209 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2023-12-09 15:12:25,209 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:12:25,209 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:12:25,209 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:12:25,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][362], [1763#true, 104#L96-5true, 394#true, 119#L62-1true, 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:12:25,487 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2023-12-09 15:12:25,487 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:12:25,487 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:12:25,487 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:12:25,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][799], [104#L96-5true, 394#true, 2715#(or (= ~break_15~0 0) (= ~break_7~0 0) (= ~break_11~0 0)), 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0)), 256#L54-2true]) [2023-12-09 15:12:25,802 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2023-12-09 15:12:25,802 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:12:25,802 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:12:25,803 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:12:28,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1043] L93-->L94: Formula: (= v_~result_12~0_3 (ite (= v_~name_1~0_7 v_~name_3~0_7) 0 v_~result_12~0_4)) InVars {~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_4, ~name_1~0=v_~name_1~0_7} OutVars{~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_3, ~name_1~0=v_~name_1~0_7} AuxVars[] AssignedVars[~result_12~0][324], [130#L94true, 394#true, 1765#(= ~break_15~0 0), 381#true, 15#L136-4true, thread3Thread1of1ForFork0InUse, 175#L85-12true, 123#L55-1true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:12:28,755 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2023-12-09 15:12:28,755 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:12:28,755 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:12:28,759 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:12:30,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][6384], [1739#true, 104#L96-5true, 394#true, 3620#(= ~result_8~0 0), 3475#(and (or (= ~break_15~0 1) (and (= ~break_15~0 0) (or (= ~break_11~0 1) (= ~break_11~0 0)))) (or (and (= ~break_15~0 0) (not (= ~name_3~0 ~name_1~0))) (= ~break_11~0 0))), 381#true, 15#L136-4true, thread3Thread1of1ForFork0InUse, 175#L85-12true, 7#L55true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse]) [2023-12-09 15:12:30,008 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2023-12-09 15:12:30,009 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:12:30,012 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:12:30,012 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:12:30,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][362], [1763#true, 104#L96-5true, 394#true, 140#L63true, 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:12:30,083 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2023-12-09 15:12:30,083 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:12:30,083 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:12:30,083 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:12:30,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][902], [104#L96-5true, 394#true, 2715#(or (= ~break_15~0 0) (= ~break_7~0 0) (= ~break_11~0 0)), 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, 7#L55true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:12:30,297 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2023-12-09 15:12:30,298 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:12:30,298 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:12:30,298 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:12:32,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1043] L93-->L94: Formula: (= v_~result_12~0_3 (ite (= v_~name_1~0_7 v_~name_3~0_7) 0 v_~result_12~0_4)) InVars {~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_4, ~name_1~0=v_~name_1~0_7} OutVars{~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_3, ~name_1~0=v_~name_1~0_7} AuxVars[] AssignedVars[~result_12~0][845], [130#L94true, 394#true, 62#L63-11true, 15#L136-4true, 381#true, 1754#(and (= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (= ~result_4~0 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 313#L85-11true, 3375#(and (or (not (= ~break_7~0 0)) (not (= ~name_2~0 ~name_1~0))) (= ~break_15~0 0)), 3615#true]) [2023-12-09 15:12:32,066 INFO L294 olderBase$Statistics]: this new event has 212 ancestors and is cut-off event [2023-12-09 15:12:32,066 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:32,066 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:32,066 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][6384], [1739#true, 104#L96-5true, 394#true, 3620#(= ~result_8~0 0), 3475#(and (or (= ~break_15~0 1) (and (= ~break_15~0 0) (or (= ~break_11~0 1) (= ~break_11~0 0)))) (or (and (= ~break_15~0 0) (not (= ~name_3~0 ~name_1~0))) (= ~break_11~0 0))), 381#true, 15#L136-4true, thread3Thread1of1ForFork0InUse, 175#L85-12true, 123#L55-1true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse]) [2023-12-09 15:12:34,146 INFO L294 olderBase$Statistics]: this new event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,146 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,146 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,146 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][984], [1763#true, 104#L96-5true, 394#true, 66#L63-1true, 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, 1751#(and (or (not (= ~name_2~0 ~name_1~0)) (= ~result_4~0 0)) (= ~break_7~0 0)), thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true]) [2023-12-09 15:12:34,298 INFO L294 olderBase$Statistics]: this new event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,298 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,298 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,298 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([925] L63-1-->L63-2: Formula: (and (= v_~name_1~0_5 |v_thread1Thread1of1ForFork1_minus_#in~a#1_1|) (= v_~name_2~0_5 |v_thread1Thread1of1ForFork1_minus_#in~b#1_1|)) InVars {~name_2~0=v_~name_2~0_5, ~name_1~0=v_~name_1~0_5} OutVars{~name_2~0=v_~name_2~0_5, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_1|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_1|, ~name_1~0=v_~name_1~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_#in~a#1][882], [130#L94true, 9#L63-2true, 394#true, 2289#(and (= ~break_15~0 0) (not (= ~name_2~0 ~name_1~0))), 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, 1751#(and (or (not (= ~name_2~0 ~name_1~0)) (= ~result_4~0 0)) (= ~break_7~0 0)), thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true]) [2023-12-09 15:12:34,298 INFO L294 olderBase$Statistics]: this new event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,298 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,298 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,298 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][985], [1763#true, 104#L96-5true, 394#true, 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, 1744#(= ~result_4~0 0), thread1Thread1of1ForFork1InUse, 3615#true, 358#L63-9true]) [2023-12-09 15:12:34,299 INFO L294 olderBase$Statistics]: this new event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,299 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,299 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,299 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][902], [104#L96-5true, 394#true, 2715#(or (= ~break_15~0 0) (= ~break_7~0 0) (= ~break_11~0 0)), 15#L136-4true, 381#true, thread3Thread1of1ForFork0InUse, 175#L85-12true, 123#L55-1true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true, 1742#(or (and (not (= ~name_2~0 ~name_1~0)) (= ~break_7~0 0)) (= ~result_4~0 0))]) [2023-12-09 15:12:34,644 INFO L294 olderBase$Statistics]: this new event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,644 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,644 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:34,644 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:12:35,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1043] L93-->L94: Formula: (= v_~result_12~0_3 (ite (= v_~name_1~0_7 v_~name_3~0_7) 0 v_~result_12~0_4)) InVars {~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_4, ~name_1~0=v_~name_1~0_7} OutVars{~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_3, ~name_1~0=v_~name_1~0_7} AuxVars[] AssignedVars[~result_12~0][845], [130#L94true, 394#true, 62#L63-11true, 381#true, 15#L136-4true, 1754#(and (= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (= ~result_4~0 0)), thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3375#(and (or (not (= ~break_7~0 0)) (not (= ~name_2~0 ~name_1~0))) (= ~break_15~0 0)), 3615#true]) [2023-12-09 15:12:35,854 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is cut-off event [2023-12-09 15:12:35,854 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:12:35,855 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:12:35,855 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:12:37,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][1095], [1763#true, 104#L96-5true, 394#true, 153#L63-10true, 15#L136-4true, 381#true, 1754#(and (= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (= ~result_4~0 0)), thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true]) [2023-12-09 15:12:37,738 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is cut-off event [2023-12-09 15:12:37,738 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:12:37,739 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:12:37,739 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:12:37,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L107-1-->L107-2: Formula: (and (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_1| v_~name_3~0_6) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_1| v_~name_1~0_6)) InVars {~name_3~0=v_~name_3~0_6, ~name_1~0=v_~name_1~0_6} OutVars{~name_3~0=v_~name_3~0_6, ~name_1~0=v_~name_1~0_6, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_1|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_minus_#in~a#1, thread3Thread1of1ForFork0_minus_#in~b#1][5103], [2324#(and (= ~break_15~0 0) (or (and (= ~break_11~0 1) (not (= ~name_3~0 ~name_1~0))) (= ~break_11~0 0))), 304#L37-5true, 394#true, 3620#(= ~result_8~0 0), 112#L107-2true, 381#true, 15#L136-4true, thread3Thread1of1ForFork0InUse, 175#L85-12true, 1751#(and (or (not (= ~name_2~0 ~name_1~0)) (= ~result_4~0 0)) (= ~break_7~0 0)), thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse]) [2023-12-09 15:12:37,858 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is cut-off event [2023-12-09 15:12:37,858 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:12:37,858 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:12:37,858 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:12:39,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1043] L93-->L94: Formula: (= v_~result_12~0_3 (ite (= v_~name_1~0_7 v_~name_3~0_7) 0 v_~result_12~0_4)) InVars {~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_4, ~name_1~0=v_~name_1~0_7} OutVars{~name_3~0=v_~name_3~0_7, ~result_12~0=v_~result_12~0_3, ~name_1~0=v_~name_1~0_7} AuxVars[] AssignedVars[~result_12~0][249], [130#L94true, 1739#true, 394#true, 183#L57true, 1765#(= ~break_15~0 0), 381#true, 15#L136-4true, thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true]) [2023-12-09 15:12:39,980 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2023-12-09 15:12:39,980 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:12:39,980 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:12:39,980 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:12:41,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L94-->L96-5: Formula: (= v_~break_15~0_4 (ite (= v_~name_1~0_8 v_~name_3~0_8) 1 v_~break_15~0_5)) InVars {~break_15~0=v_~break_15~0_5, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} OutVars{~break_15~0=v_~break_15~0_4, ~name_3~0=v_~name_3~0_8, ~name_1~0=v_~name_1~0_8} AuxVars[] AssignedVars[~break_15~0][1095], [1763#true, 104#L96-5true, 394#true, 62#L63-11true, 15#L136-4true, 381#true, 1754#(and (= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (= ~result_4~0 0)), thread3Thread1of1ForFork0InUse, 175#L85-12true, thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse, 3615#true]) [2023-12-09 15:12:41,029 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2023-12-09 15:12:41,029 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:12:41,029 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:12:41,029 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:12:41,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1069] L107-1-->L107-2: Formula: (and (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_1| v_~name_3~0_6) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_1| v_~name_1~0_6)) InVars {~name_3~0=v_~name_3~0_6, ~name_1~0=v_~name_1~0_6} OutVars{~name_3~0=v_~name_3~0_6, ~name_1~0=v_~name_1~0_6, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_1|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_minus_#in~a#1, thread3Thread1of1ForFork0_minus_#in~b#1][5103], [2324#(and (= ~break_15~0 0) (or (and (= ~break_11~0 1) (not (= ~name_3~0 ~name_1~0))) (= ~break_11~0 0))), 394#true, 3620#(= ~result_8~0 0), 265#L159-2true, 112#L107-2true, 381#true, 15#L136-4true, thread3Thread1of1ForFork0InUse, 175#L85-12true, 1751#(and (or (not (= ~name_2~0 ~name_1~0)) (= ~result_4~0 0)) (= ~break_7~0 0)), thread2Thread1of1ForFork2InUse, 384#true, thread1Thread1of1ForFork1InUse]) [2023-12-09 15:12:41,385 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2023-12-09 15:12:41,385 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:12:41,385 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:12:41,385 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event