/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 08:46:02,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 08:46:02,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 08:46:02,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 08:46:02,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 08:46:02,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 08:46:02,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 08:46:02,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 08:46:02,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 08:46:02,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 08:46:02,592 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 08:46:02,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 08:46:02,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 08:46:02,594 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 08:46:02,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 08:46:02,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 08:46:02,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 08:46:02,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 08:46:02,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 08:46:02,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 08:46:02,595 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 08:46:02,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 08:46:02,595 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 08:46:02,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 08:46:02,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 08:46:02,596 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 08:46:02,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 08:46:02,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 08:46:02,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 08:46:02,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 08:46:02,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 08:46:02,597 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 08:46:02,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 08:46:02,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 08:46:02,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 08:46:02,598 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 08:46:02,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 08:46:02,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 08:46:02,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 08:46:02,867 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 08:46:02,867 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 08:46:02,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-08-24 08:46:03,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 08:46:04,073 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 08:46:04,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-08-24 08:46:04,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6443a4155/3f8143c3ca3f4b9da40305e85260db7f/FLAG7fbf465f8 [2023-08-24 08:46:04,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6443a4155/3f8143c3ca3f4b9da40305e85260db7f [2023-08-24 08:46:04,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 08:46:04,484 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 08:46:04,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 08:46:04,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 08:46:04,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 08:46:04,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 08:46:04" (1/1) ... [2023-08-24 08:46:04,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b61550f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:46:04, skipping insertion in model container [2023-08-24 08:46:04,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 08:46:04" (1/1) ... [2023-08-24 08:46:04,503 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 08:46:04,631 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/popl20-counter-determinism.wvr.c[2476,2489] [2023-08-24 08:46:04,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 08:46:04,643 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 08:46:04,674 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/popl20-counter-determinism.wvr.c[2476,2489] [2023-08-24 08:46:04,675 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 08:46:04,680 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 08:46:04,680 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 08:46:04,686 INFO L206 MainTranslator]: Completed translation [2023-08-24 08:46:04,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:46:04 WrapperNode [2023-08-24 08:46:04,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 08:46:04,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 08:46:04,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 08:46:04,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 08:46:04,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:46:04" (1/1) ... [2023-08-24 08:46:04,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:46:04" (1/1) ... [2023-08-24 08:46:04,728 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 119 [2023-08-24 08:46:04,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 08:46:04,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 08:46:04,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 08:46:04,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 08:46:04,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:46:04" (1/1) ... [2023-08-24 08:46:04,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:46:04" (1/1) ... [2023-08-24 08:46:04,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:46:04" (1/1) ... [2023-08-24 08:46:04,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:46:04" (1/1) ... [2023-08-24 08:46:04,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:46:04" (1/1) ... [2023-08-24 08:46:04,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:46:04" (1/1) ... [2023-08-24 08:46:04,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:46:04" (1/1) ... [2023-08-24 08:46:04,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:46:04" (1/1) ... [2023-08-24 08:46:04,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 08:46:04,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 08:46:04,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 08:46:04,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 08:46:04,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:46:04" (1/1) ... [2023-08-24 08:46:04,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 08:46:04,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:46:04,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 08:46:04,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 08:46:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 08:46:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 08:46:04,847 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 08:46:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 08:46:04,847 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 08:46:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 08:46:04,848 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 08:46:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 08:46:04,848 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 08:46:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 08:46:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 08:46:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 08:46:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 08:46:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 08:46:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 08:46:04,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 08:46:04,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 08:46:04,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 08:46:04,851 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 08:46:04,934 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 08:46:04,935 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 08:46:05,129 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 08:46:05,168 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 08:46:05,169 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 08:46:05,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 08:46:05 BoogieIcfgContainer [2023-08-24 08:46:05,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 08:46:05,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 08:46:05,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 08:46:05,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 08:46:05,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 08:46:04" (1/3) ... [2023-08-24 08:46:05,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5eeba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 08:46:05, skipping insertion in model container [2023-08-24 08:46:05,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:46:04" (2/3) ... [2023-08-24 08:46:05,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5eeba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 08:46:05, skipping insertion in model container [2023-08-24 08:46:05,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 08:46:05" (3/3) ... [2023-08-24 08:46:05,178 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2023-08-24 08:46:05,188 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 08:46:05,189 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 08:46:05,189 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 08:46:05,260 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-24 08:46:05,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 124 transitions, 280 flow [2023-08-24 08:46:05,324 INFO L124 PetriNetUnfolderBase]: 9/120 cut-off events. [2023-08-24 08:46:05,324 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 08:46:05,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 120 events. 9/120 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 106 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-08-24 08:46:05,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 124 transitions, 280 flow [2023-08-24 08:46:05,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 108 transitions, 240 flow [2023-08-24 08:46:05,338 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 08:46:05,348 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 108 transitions, 240 flow [2023-08-24 08:46:05,350 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 108 transitions, 240 flow [2023-08-24 08:46:05,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 108 transitions, 240 flow [2023-08-24 08:46:05,376 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-08-24 08:46:05,377 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 08:46:05,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 108 events. 9/108 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 105 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-08-24 08:46:05,380 INFO L119 LiptonReduction]: Number of co-enabled transitions 2904 [2023-08-24 08:46:07,902 INFO L134 LiptonReduction]: Checked pairs total: 2832 [2023-08-24 08:46:07,902 INFO L136 LiptonReduction]: Total number of compositions: 86 [2023-08-24 08:46:07,912 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 08:46:07,916 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d04b36e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 08:46:07,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 08:46:07,921 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 08:46:07,921 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2023-08-24 08:46:07,921 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 08:46:07,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:07,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:07,922 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:07,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:07,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1027665342, now seen corresponding path program 1 times [2023-08-24 08:46:07,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:07,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77942313] [2023-08-24 08:46:07,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:07,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:08,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:08,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77942313] [2023-08-24 08:46:08,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77942313] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:08,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:08,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 08:46:08,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15809878] [2023-08-24 08:46:08,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:08,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 08:46:08,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:08,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 08:46:08,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 08:46:08,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 210 [2023-08-24 08:46:08,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:08,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:08,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 210 [2023-08-24 08:46:08,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:08,541 INFO L124 PetriNetUnfolderBase]: 1537/1954 cut-off events. [2023-08-24 08:46:08,541 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2023-08-24 08:46:08,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 1954 events. 1537/1954 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6406 event pairs, 141 based on Foata normal form. 1/1138 useless extension candidates. Maximal degree in co-relation 3091. Up to 1733 conditions per place. [2023-08-24 08:46:08,556 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-08-24 08:46:08,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 241 flow [2023-08-24 08:46:08,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 08:46:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 08:46:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-24 08:46:08,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2023-08-24 08:46:08,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-24 08:46:08,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-24 08:46:08,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:08,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-24 08:46:08,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:08,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:08,585 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:08,586 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 82 flow. Second operand 3 states and 357 transitions. [2023-08-24 08:46:08,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 241 flow [2023-08-24 08:46:08,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 211 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-24 08:46:08,592 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 99 flow [2023-08-24 08:46:08,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2023-08-24 08:46:08,596 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2023-08-24 08:46:08,597 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 99 flow [2023-08-24 08:46:08,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:08,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:08,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:08,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 08:46:08,598 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:08,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:08,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1895265813, now seen corresponding path program 1 times [2023-08-24 08:46:08,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:08,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831415248] [2023-08-24 08:46:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:08,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:08,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:08,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831415248] [2023-08-24 08:46:08,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831415248] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:08,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:08,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:08,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997055916] [2023-08-24 08:46:08,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:08,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:08,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:08,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:08,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:08,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:08,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:08,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:08,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:08,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:08,966 INFO L124 PetriNetUnfolderBase]: 2533/3290 cut-off events. [2023-08-24 08:46:08,967 INFO L125 PetriNetUnfolderBase]: For 1011/1011 co-relation queries the response was YES. [2023-08-24 08:46:08,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8066 conditions, 3290 events. 2533/3290 cut-off events. For 1011/1011 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 13814 event pairs, 598 based on Foata normal form. 62/3352 useless extension candidates. Maximal degree in co-relation 2589. Up to 1576 conditions per place. [2023-08-24 08:46:08,983 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 83 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2023-08-24 08:46:08,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 91 transitions, 450 flow [2023-08-24 08:46:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-24 08:46:08,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2023-08-24 08:46:08,985 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-24 08:46:08,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-24 08:46:08,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:08,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-24 08:46:08,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:08,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:08,990 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:08,990 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 99 flow. Second operand 5 states and 518 transitions. [2023-08-24 08:46:08,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 91 transitions, 450 flow [2023-08-24 08:46:08,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 91 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 08:46:08,993 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 137 flow [2023-08-24 08:46:08,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2023-08-24 08:46:08,994 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2023-08-24 08:46:08,994 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 137 flow [2023-08-24 08:46:08,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:08,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:08,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:08,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 08:46:08,995 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:08,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:08,995 INFO L85 PathProgramCache]: Analyzing trace with hash -744169450, now seen corresponding path program 1 times [2023-08-24 08:46:08,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:08,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013054622] [2023-08-24 08:46:08,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:08,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:09,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:09,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013054622] [2023-08-24 08:46:09,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013054622] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:46:09,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110413275] [2023-08-24 08:46:09,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:09,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:46:09,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:46:09,073 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-08-24 08:46:09,114 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-08-24 08:46:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:09,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 08:46:09,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:46:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:09,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:46:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:09,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110413275] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:46:09,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:46:09,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-24 08:46:09,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428918419] [2023-08-24 08:46:09,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:46:09,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 08:46:09,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 08:46:09,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-24 08:46:09,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:09,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 137 flow. Second operand has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:09,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:09,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:09,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:09,687 INFO L124 PetriNetUnfolderBase]: 3356/4459 cut-off events. [2023-08-24 08:46:09,687 INFO L125 PetriNetUnfolderBase]: For 4057/4547 co-relation queries the response was YES. [2023-08-24 08:46:09,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12805 conditions, 4459 events. 3356/4459 cut-off events. For 4057/4547 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 19696 event pairs, 643 based on Foata normal form. 590/4962 useless extension candidates. Maximal degree in co-relation 5434. Up to 1604 conditions per place. [2023-08-24 08:46:09,708 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 116 selfloop transitions, 10 changer transitions 0/129 dead transitions. [2023-08-24 08:46:09,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 129 transitions, 742 flow [2023-08-24 08:46:09,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 08:46:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 08:46:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 719 transitions. [2023-08-24 08:46:09,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891156462585034 [2023-08-24 08:46:09,710 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 719 transitions. [2023-08-24 08:46:09,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 719 transitions. [2023-08-24 08:46:09,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:09,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 719 transitions. [2023-08-24 08:46:09,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:09,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:09,714 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:09,714 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 137 flow. Second operand 7 states and 719 transitions. [2023-08-24 08:46:09,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 129 transitions, 742 flow [2023-08-24 08:46:09,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 129 transitions, 717 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-24 08:46:09,726 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 202 flow [2023-08-24 08:46:09,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-24 08:46:09,727 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2023-08-24 08:46:09,727 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 202 flow [2023-08-24 08:46:09,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:09,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:09,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:09,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 08:46:09,933 WARN L477 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-08-24 08:46:09,933 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:09,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:09,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2074666379, now seen corresponding path program 1 times [2023-08-24 08:46:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:09,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195612102] [2023-08-24 08:46:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:09,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:10,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:10,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195612102] [2023-08-24 08:46:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195612102] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:46:10,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191765236] [2023-08-24 08:46:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:10,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:46:10,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:46:10,033 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-08-24 08:46:10,034 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-08-24 08:46:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:10,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 08:46:10,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:46:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:10,147 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:46:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:10,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191765236] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:46:10,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:46:10,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-24 08:46:10,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017903492] [2023-08-24 08:46:10,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:46:10,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 08:46:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:10,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 08:46:10,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-24 08:46:10,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:10,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 202 flow. Second operand has 8 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:10,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:10,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:10,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:10,633 INFO L124 PetriNetUnfolderBase]: 3797/5007 cut-off events. [2023-08-24 08:46:10,633 INFO L125 PetriNetUnfolderBase]: For 9696/10023 co-relation queries the response was YES. [2023-08-24 08:46:10,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18021 conditions, 5007 events. 3797/5007 cut-off events. For 9696/10023 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 21826 event pairs, 547 based on Foata normal form. 415/5344 useless extension candidates. Maximal degree in co-relation 10010. Up to 1909 conditions per place. [2023-08-24 08:46:10,656 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 129 selfloop transitions, 18 changer transitions 0/150 dead transitions. [2023-08-24 08:46:10,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 150 transitions, 1018 flow [2023-08-24 08:46:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 08:46:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 08:46:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 719 transitions. [2023-08-24 08:46:10,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891156462585034 [2023-08-24 08:46:10,658 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 719 transitions. [2023-08-24 08:46:10,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 719 transitions. [2023-08-24 08:46:10,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:10,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 719 transitions. [2023-08-24 08:46:10,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:10,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:10,662 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:10,662 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 202 flow. Second operand 7 states and 719 transitions. [2023-08-24 08:46:10,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 150 transitions, 1018 flow [2023-08-24 08:46:10,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 150 transitions, 971 flow, removed 20 selfloop flow, removed 1 redundant places. [2023-08-24 08:46:10,676 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 366 flow [2023-08-24 08:46:10,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=366, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2023-08-24 08:46:10,677 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2023-08-24 08:46:10,677 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 366 flow [2023-08-24 08:46:10,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:10,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:10,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:10,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 08:46:10,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-24 08:46:10,881 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:10,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:10,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1944302148, now seen corresponding path program 1 times [2023-08-24 08:46:10,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:10,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480945288] [2023-08-24 08:46:10,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:10,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:10,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:10,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480945288] [2023-08-24 08:46:10,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480945288] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:10,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:10,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:10,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360818244] [2023-08-24 08:46:10,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:10,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:10,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:10,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:10,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:10,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:10,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:10,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:10,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:10,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:11,395 INFO L124 PetriNetUnfolderBase]: 5405/7069 cut-off events. [2023-08-24 08:46:11,395 INFO L125 PetriNetUnfolderBase]: For 28345/28706 co-relation queries the response was YES. [2023-08-24 08:46:11,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29097 conditions, 7069 events. 5405/7069 cut-off events. For 28345/28706 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 31320 event pairs, 1298 based on Foata normal form. 459/7401 useless extension candidates. Maximal degree in co-relation 14052. Up to 4348 conditions per place. [2023-08-24 08:46:11,450 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 87 selfloop transitions, 30 changer transitions 2/122 dead transitions. [2023-08-24 08:46:11,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 122 transitions, 970 flow [2023-08-24 08:46:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-24 08:46:11,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847619047619048 [2023-08-24 08:46:11,465 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-24 08:46:11,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-24 08:46:11,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:11,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-24 08:46:11,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:11,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:11,468 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:11,468 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 366 flow. Second operand 5 states and 509 transitions. [2023-08-24 08:46:11,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 122 transitions, 970 flow [2023-08-24 08:46:11,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 122 transitions, 944 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 08:46:11,520 INFO L231 Difference]: Finished difference. Result has 62 places, 69 transitions, 558 flow [2023-08-24 08:46:11,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=558, PETRI_PLACES=62, PETRI_TRANSITIONS=69} [2023-08-24 08:46:11,520 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2023-08-24 08:46:11,520 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 69 transitions, 558 flow [2023-08-24 08:46:11,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:11,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:11,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:11,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 08:46:11,521 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:11,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:11,521 INFO L85 PathProgramCache]: Analyzing trace with hash -696078719, now seen corresponding path program 2 times [2023-08-24 08:46:11,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:11,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077130488] [2023-08-24 08:46:11,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:11,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:11,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:11,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077130488] [2023-08-24 08:46:11,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077130488] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:11,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:11,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:11,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923919815] [2023-08-24 08:46:11,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:11,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:11,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:11,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:11,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:11,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:11,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 69 transitions, 558 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:11,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:11,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:11,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:12,035 INFO L124 PetriNetUnfolderBase]: 5508/7313 cut-off events. [2023-08-24 08:46:12,035 INFO L125 PetriNetUnfolderBase]: For 44725/45718 co-relation queries the response was YES. [2023-08-24 08:46:12,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34021 conditions, 7313 events. 5508/7313 cut-off events. For 44725/45718 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 33642 event pairs, 1239 based on Foata normal form. 973/8238 useless extension candidates. Maximal degree in co-relation 19643. Up to 3858 conditions per place. [2023-08-24 08:46:12,072 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 128 selfloop transitions, 12 changer transitions 0/150 dead transitions. [2023-08-24 08:46:12,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 150 transitions, 1373 flow [2023-08-24 08:46:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2023-08-24 08:46:12,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2023-08-24 08:46:12,074 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2023-08-24 08:46:12,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2023-08-24 08:46:12,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:12,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2023-08-24 08:46:12,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:12,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:12,076 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:12,076 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 558 flow. Second operand 5 states and 516 transitions. [2023-08-24 08:46:12,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 150 transitions, 1373 flow [2023-08-24 08:46:12,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 150 transitions, 1265 flow, removed 54 selfloop flow, removed 0 redundant places. [2023-08-24 08:46:12,318 INFO L231 Difference]: Finished difference. Result has 68 places, 73 transitions, 580 flow [2023-08-24 08:46:12,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=580, PETRI_PLACES=68, PETRI_TRANSITIONS=73} [2023-08-24 08:46:12,319 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2023-08-24 08:46:12,319 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 73 transitions, 580 flow [2023-08-24 08:46:12,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:12,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:12,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:12,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 08:46:12,319 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:12,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:12,320 INFO L85 PathProgramCache]: Analyzing trace with hash -312159770, now seen corresponding path program 2 times [2023-08-24 08:46:12,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:12,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339595292] [2023-08-24 08:46:12,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:12,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:12,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:12,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339595292] [2023-08-24 08:46:12,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339595292] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:46:12,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439890921] [2023-08-24 08:46:12,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 08:46:12,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:46:12,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:46:12,393 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 08:46:12,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 08:46:12,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 08:46:12,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 08:46:12,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 08:46:12,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:46:12,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:12,517 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:46:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:12,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439890921] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:46:12,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:46:12,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-24 08:46:12,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307593040] [2023-08-24 08:46:12,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:46:12,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 08:46:12,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:12,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 08:46:12,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-24 08:46:12,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:12,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 73 transitions, 580 flow. Second operand has 10 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:12,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:12,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:12,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:13,315 INFO L124 PetriNetUnfolderBase]: 6648/8713 cut-off events. [2023-08-24 08:46:13,315 INFO L125 PetriNetUnfolderBase]: For 40036/40644 co-relation queries the response was YES. [2023-08-24 08:46:13,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40123 conditions, 8713 events. 6648/8713 cut-off events. For 40036/40644 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 40663 event pairs, 1165 based on Foata normal form. 687/9210 useless extension candidates. Maximal degree in co-relation 23645. Up to 4523 conditions per place. [2023-08-24 08:46:13,354 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 178 selfloop transitions, 42 changer transitions 0/225 dead transitions. [2023-08-24 08:46:13,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 225 transitions, 1995 flow [2023-08-24 08:46:13,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 08:46:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 08:46:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1012 transitions. [2023-08-24 08:46:13,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819047619047619 [2023-08-24 08:46:13,357 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1012 transitions. [2023-08-24 08:46:13,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1012 transitions. [2023-08-24 08:46:13,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:13,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1012 transitions. [2023-08-24 08:46:13,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.2) internal successors, (1012), 10 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:13,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 210.0) internal successors, (2310), 11 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:13,361 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 210.0) internal successors, (2310), 11 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:13,361 INFO L175 Difference]: Start difference. First operand has 68 places, 73 transitions, 580 flow. Second operand 10 states and 1012 transitions. [2023-08-24 08:46:13,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 225 transitions, 1995 flow [2023-08-24 08:46:13,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 225 transitions, 1976 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 08:46:13,448 INFO L231 Difference]: Finished difference. Result has 81 places, 102 transitions, 1066 flow [2023-08-24 08:46:13,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1066, PETRI_PLACES=81, PETRI_TRANSITIONS=102} [2023-08-24 08:46:13,449 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 43 predicate places. [2023-08-24 08:46:13,449 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 102 transitions, 1066 flow [2023-08-24 08:46:13,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:13,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:13,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:13,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-24 08:46:13,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:46:13,656 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:13,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash 612071379, now seen corresponding path program 3 times [2023-08-24 08:46:13,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:13,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397421066] [2023-08-24 08:46:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:13,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:13,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397421066] [2023-08-24 08:46:13,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397421066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:13,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:13,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:13,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682741305] [2023-08-24 08:46:13,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:13,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:13,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:13,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:13,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:13,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:13,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 102 transitions, 1066 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:13,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:13,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:13,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:14,493 INFO L124 PetriNetUnfolderBase]: 7279/9861 cut-off events. [2023-08-24 08:46:14,494 INFO L125 PetriNetUnfolderBase]: For 55716/56163 co-relation queries the response was YES. [2023-08-24 08:46:14,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49599 conditions, 9861 events. 7279/9861 cut-off events. For 55716/56163 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 47891 event pairs, 1450 based on Foata normal form. 403/10262 useless extension candidates. Maximal degree in co-relation 46808. Up to 4264 conditions per place. [2023-08-24 08:46:14,555 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 117 selfloop transitions, 55 changer transitions 3/178 dead transitions. [2023-08-24 08:46:14,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 178 transitions, 1881 flow [2023-08-24 08:46:14,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2023-08-24 08:46:14,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895238095238095 [2023-08-24 08:46:14,557 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 514 transitions. [2023-08-24 08:46:14,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 514 transitions. [2023-08-24 08:46:14,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:14,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 514 transitions. [2023-08-24 08:46:14,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:14,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:14,560 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:14,560 INFO L175 Difference]: Start difference. First operand has 81 places, 102 transitions, 1066 flow. Second operand 5 states and 514 transitions. [2023-08-24 08:46:14,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 178 transitions, 1881 flow [2023-08-24 08:46:14,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 178 transitions, 1767 flow, removed 31 selfloop flow, removed 3 redundant places. [2023-08-24 08:46:14,819 INFO L231 Difference]: Finished difference. Result has 84 places, 108 transitions, 1155 flow [2023-08-24 08:46:14,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1155, PETRI_PLACES=84, PETRI_TRANSITIONS=108} [2023-08-24 08:46:14,819 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2023-08-24 08:46:14,820 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 108 transitions, 1155 flow [2023-08-24 08:46:14,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:14,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:14,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:14,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 08:46:14,820 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:14,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:14,820 INFO L85 PathProgramCache]: Analyzing trace with hash 666235612, now seen corresponding path program 2 times [2023-08-24 08:46:14,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:14,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256574824] [2023-08-24 08:46:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:14,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:14,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:14,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256574824] [2023-08-24 08:46:14,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256574824] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:14,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:14,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:14,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233094752] [2023-08-24 08:46:14,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:14,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:14,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:14,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:14,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:14,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:14,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 108 transitions, 1155 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:14,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:14,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:14,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:15,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][66], [113#L72-4true, 678#(<= 1 ~N~0), Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, 7#L91-4true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 670#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), 316#(<= 1 ~N~0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, 6#thread3EXITtrue, Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, 34#thread1EXITtrue, 667#true, Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0))]) [2023-08-24 08:46:15,486 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 08:46:15,486 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:46:15,486 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 08:46:15,486 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 08:46:15,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][66], [113#L72-4true, 678#(<= 1 ~N~0), Black: 133#(= ~counter2~0 ~counter1~0), 88#L92-1true, 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 670#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), 316#(<= 1 ~N~0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, 6#thread3EXITtrue, Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, 34#thread1EXITtrue, 667#true, Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0))]) [2023-08-24 08:46:15,545 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-24 08:46:15,545 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:46:15,545 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 08:46:15,545 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:46:15,663 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][66], [113#L72-4true, 678#(<= 1 ~N~0), Black: 133#(= ~counter2~0 ~counter1~0), 47#L92-2true, 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 670#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), 316#(<= 1 ~N~0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, 6#thread3EXITtrue, Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, 667#true, Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0))]) [2023-08-24 08:46:15,663 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-24 08:46:15,664 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 08:46:15,664 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 08:46:15,664 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 08:46:15,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][66], [113#L72-4true, 678#(<= 1 ~N~0), Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 94#L93-1true, Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 670#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), 316#(<= 1 ~N~0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, 6#thread3EXITtrue, Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, 667#true, Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0))]) [2023-08-24 08:46:15,692 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 08:46:15,692 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 08:46:15,692 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 08:46:15,692 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 08:46:15,732 INFO L124 PetriNetUnfolderBase]: 8277/10967 cut-off events. [2023-08-24 08:46:15,732 INFO L125 PetriNetUnfolderBase]: For 76737/77614 co-relation queries the response was YES. [2023-08-24 08:46:15,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58100 conditions, 10967 events. 8277/10967 cut-off events. For 76737/77614 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 53285 event pairs, 1253 based on Foata normal form. 809/11477 useless extension candidates. Maximal degree in co-relation 52773. Up to 4074 conditions per place. [2023-08-24 08:46:15,784 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 107 selfloop transitions, 51 changer transitions 0/167 dead transitions. [2023-08-24 08:46:15,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 167 transitions, 1827 flow [2023-08-24 08:46:15,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-08-24 08:46:15,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876190476190476 [2023-08-24 08:46:15,786 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-08-24 08:46:15,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-08-24 08:46:15,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:15,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-08-24 08:46:15,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:15,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:15,792 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:15,792 INFO L175 Difference]: Start difference. First operand has 84 places, 108 transitions, 1155 flow. Second operand 5 states and 512 transitions. [2023-08-24 08:46:15,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 167 transitions, 1827 flow [2023-08-24 08:46:15,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 167 transitions, 1733 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 08:46:15,990 INFO L231 Difference]: Finished difference. Result has 88 places, 110 transitions, 1216 flow [2023-08-24 08:46:15,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1216, PETRI_PLACES=88, PETRI_TRANSITIONS=110} [2023-08-24 08:46:15,990 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2023-08-24 08:46:15,991 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 110 transitions, 1216 flow [2023-08-24 08:46:15,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:15,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:15,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:15,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 08:46:15,991 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:15,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:15,991 INFO L85 PathProgramCache]: Analyzing trace with hash -495897952, now seen corresponding path program 3 times [2023-08-24 08:46:15,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:15,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711397709] [2023-08-24 08:46:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:16,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:16,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711397709] [2023-08-24 08:46:16,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711397709] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:16,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:16,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:16,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506059157] [2023-08-24 08:46:16,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:16,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:16,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:16,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:16,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:16,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:16,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 110 transitions, 1216 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:16,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:16,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:16,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:16,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][62], [60#L62-4true, 113#L72-4true, 88#L92-1true, Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), 683#true, Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 670#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 678#(<= 1 ~N~0), 496#true, Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 34#thread1EXITtrue, Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 677#(= thread3Thread1of1ForFork0_~i~2 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0))]) [2023-08-24 08:46:16,624 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 08:46:16,624 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 08:46:16,624 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 08:46:16,624 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 08:46:16,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][62], [60#L62-4true, 113#L72-4true, Black: 133#(= ~counter2~0 ~counter1~0), 47#L92-2true, 491#(<= ~N~0 0), 683#true, Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 670#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 678#(<= 1 ~N~0), 496#true, Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 677#(= thread3Thread1of1ForFork0_~i~2 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0))]) [2023-08-24 08:46:16,741 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 08:46:16,741 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 08:46:16,741 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:46:16,741 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 08:46:16,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][62], [60#L62-4true, 113#L72-4true, Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), 683#true, 94#L93-1true, Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 670#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 678#(<= 1 ~N~0), 496#true, Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 677#(= thread3Thread1of1ForFork0_~i~2 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0))]) [2023-08-24 08:46:16,907 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-24 08:46:16,907 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:46:16,907 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 08:46:16,907 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:46:17,028 INFO L124 PetriNetUnfolderBase]: 8797/11661 cut-off events. [2023-08-24 08:46:17,028 INFO L125 PetriNetUnfolderBase]: For 104102/105565 co-relation queries the response was YES. [2023-08-24 08:46:17,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63593 conditions, 11661 events. 8797/11661 cut-off events. For 104102/105565 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 58057 event pairs, 1573 based on Foata normal form. 1396/12618 useless extension candidates. Maximal degree in co-relation 58966. Up to 6320 conditions per place. [2023-08-24 08:46:17,081 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 207 selfloop transitions, 11 changer transitions 3/240 dead transitions. [2023-08-24 08:46:17,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 240 transitions, 2862 flow [2023-08-24 08:46:17,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-24 08:46:17,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2023-08-24 08:46:17,082 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-24 08:46:17,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-24 08:46:17,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:17,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-24 08:46:17,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:17,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:17,085 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:17,085 INFO L175 Difference]: Start difference. First operand has 88 places, 110 transitions, 1216 flow. Second operand 5 states and 518 transitions. [2023-08-24 08:46:17,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 240 transitions, 2862 flow [2023-08-24 08:46:17,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 240 transitions, 2747 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 08:46:17,296 INFO L231 Difference]: Finished difference. Result has 92 places, 115 transitions, 1253 flow [2023-08-24 08:46:17,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1253, PETRI_PLACES=92, PETRI_TRANSITIONS=115} [2023-08-24 08:46:17,297 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2023-08-24 08:46:17,297 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 115 transitions, 1253 flow [2023-08-24 08:46:17,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:17,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:17,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:17,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 08:46:17,297 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:17,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:17,298 INFO L85 PathProgramCache]: Analyzing trace with hash 982669773, now seen corresponding path program 2 times [2023-08-24 08:46:17,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:17,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348586047] [2023-08-24 08:46:17,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:17,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:17,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:17,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348586047] [2023-08-24 08:46:17,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348586047] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:17,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:17,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:17,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845271922] [2023-08-24 08:46:17,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:17,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:17,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:17,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:17,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:17,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:17,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 115 transitions, 1253 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:17,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:17,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:17,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:18,272 INFO L124 PetriNetUnfolderBase]: 8636/11586 cut-off events. [2023-08-24 08:46:18,272 INFO L125 PetriNetUnfolderBase]: For 97095/98373 co-relation queries the response was YES. [2023-08-24 08:46:18,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64735 conditions, 11586 events. 8636/11586 cut-off events. For 97095/98373 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 58733 event pairs, 1944 based on Foata normal form. 1167/12334 useless extension candidates. Maximal degree in co-relation 60906. Up to 6414 conditions per place. [2023-08-24 08:46:18,327 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 151 selfloop transitions, 18 changer transitions 4/192 dead transitions. [2023-08-24 08:46:18,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 192 transitions, 2183 flow [2023-08-24 08:46:18,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2023-08-24 08:46:18,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895238095238095 [2023-08-24 08:46:18,329 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 514 transitions. [2023-08-24 08:46:18,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 514 transitions. [2023-08-24 08:46:18,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:18,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 514 transitions. [2023-08-24 08:46:18,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:18,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:18,331 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:18,331 INFO L175 Difference]: Start difference. First operand has 92 places, 115 transitions, 1253 flow. Second operand 5 states and 514 transitions. [2023-08-24 08:46:18,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 192 transitions, 2183 flow [2023-08-24 08:46:18,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 192 transitions, 2149 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 08:46:18,705 INFO L231 Difference]: Finished difference. Result has 96 places, 117 transitions, 1316 flow [2023-08-24 08:46:18,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1316, PETRI_PLACES=96, PETRI_TRANSITIONS=117} [2023-08-24 08:46:18,705 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 58 predicate places. [2023-08-24 08:46:18,705 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 117 transitions, 1316 flow [2023-08-24 08:46:18,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:18,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:18,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:18,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 08:46:18,706 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:18,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:18,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1195941933, now seen corresponding path program 3 times [2023-08-24 08:46:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:18,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698381260] [2023-08-24 08:46:18,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:18,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:18,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:18,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698381260] [2023-08-24 08:46:18,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698381260] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:46:18,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123092215] [2023-08-24 08:46:18,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 08:46:18,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:46:18,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:46:18,772 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 08:46:18,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 08:46:18,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 08:46:18,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 08:46:18,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 08:46:18,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:46:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:18,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:46:18,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:18,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123092215] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:46:18,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:46:18,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-24 08:46:18,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589736531] [2023-08-24 08:46:18,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:46:18,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 08:46:18,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:18,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 08:46:18,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-24 08:46:18,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:18,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 117 transitions, 1316 flow. Second operand has 10 states, 10 states have (on average 92.0) internal successors, (920), 10 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:18,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:18,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:18,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:20,350 INFO L124 PetriNetUnfolderBase]: 11456/15071 cut-off events. [2023-08-24 08:46:20,351 INFO L125 PetriNetUnfolderBase]: For 141161/142507 co-relation queries the response was YES. [2023-08-24 08:46:20,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87558 conditions, 15071 events. 11456/15071 cut-off events. For 141161/142507 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 76232 event pairs, 1482 based on Foata normal form. 1214/15850 useless extension candidates. Maximal degree in co-relation 81862. Up to 8348 conditions per place. [2023-08-24 08:46:20,452 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 273 selfloop transitions, 92 changer transitions 5/381 dead transitions. [2023-08-24 08:46:20,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 381 transitions, 4827 flow [2023-08-24 08:46:20,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 08:46:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 08:46:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1004 transitions. [2023-08-24 08:46:20,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4780952380952381 [2023-08-24 08:46:20,455 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1004 transitions. [2023-08-24 08:46:20,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1004 transitions. [2023-08-24 08:46:20,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:20,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1004 transitions. [2023-08-24 08:46:20,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.4) internal successors, (1004), 10 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:20,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 210.0) internal successors, (2310), 11 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:20,459 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 210.0) internal successors, (2310), 11 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:20,459 INFO L175 Difference]: Start difference. First operand has 96 places, 117 transitions, 1316 flow. Second operand 10 states and 1004 transitions. [2023-08-24 08:46:20,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 381 transitions, 4827 flow [2023-08-24 08:46:20,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 381 transitions, 4731 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-24 08:46:20,767 INFO L231 Difference]: Finished difference. Result has 109 places, 185 transitions, 2668 flow [2023-08-24 08:46:20,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2668, PETRI_PLACES=109, PETRI_TRANSITIONS=185} [2023-08-24 08:46:20,767 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 71 predicate places. [2023-08-24 08:46:20,767 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 185 transitions, 2668 flow [2023-08-24 08:46:20,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 92.0) internal successors, (920), 10 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:20,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:20,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:20,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-24 08:46:20,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:46:20,972 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:20,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:20,973 INFO L85 PathProgramCache]: Analyzing trace with hash -396821945, now seen corresponding path program 4 times [2023-08-24 08:46:20,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:20,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966619854] [2023-08-24 08:46:20,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:20,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:21,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:21,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966619854] [2023-08-24 08:46:21,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966619854] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:21,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:21,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:21,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845506890] [2023-08-24 08:46:21,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:21,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:21,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:21,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:21,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:21,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:21,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 185 transitions, 2668 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:21,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:21,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:21,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:22,798 INFO L124 PetriNetUnfolderBase]: 13707/18240 cut-off events. [2023-08-24 08:46:22,798 INFO L125 PetriNetUnfolderBase]: For 204573/205459 co-relation queries the response was YES. [2023-08-24 08:46:22,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117177 conditions, 18240 events. 13707/18240 cut-off events. For 204573/205459 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 91741 event pairs, 2545 based on Foata normal form. 830/18897 useless extension candidates. Maximal degree in co-relation 108584. Up to 8991 conditions per place. [2023-08-24 08:46:22,895 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 139 selfloop transitions, 215 changer transitions 3/364 dead transitions. [2023-08-24 08:46:22,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 364 transitions, 5858 flow [2023-08-24 08:46:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-24 08:46:22,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847619047619048 [2023-08-24 08:46:22,897 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-24 08:46:22,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-24 08:46:22,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:22,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-24 08:46:22,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:22,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:22,899 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:22,900 INFO L175 Difference]: Start difference. First operand has 109 places, 185 transitions, 2668 flow. Second operand 5 states and 509 transitions. [2023-08-24 08:46:22,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 364 transitions, 5858 flow [2023-08-24 08:46:23,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 364 transitions, 5358 flow, removed 150 selfloop flow, removed 4 redundant places. [2023-08-24 08:46:23,988 INFO L231 Difference]: Finished difference. Result has 112 places, 290 transitions, 4727 flow [2023-08-24 08:46:23,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=2408, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4727, PETRI_PLACES=112, PETRI_TRANSITIONS=290} [2023-08-24 08:46:23,989 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 74 predicate places. [2023-08-24 08:46:23,989 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 290 transitions, 4727 flow [2023-08-24 08:46:23,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:23,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:23,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:23,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 08:46:23,989 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:23,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:23,990 INFO L85 PathProgramCache]: Analyzing trace with hash -122250803, now seen corresponding path program 4 times [2023-08-24 08:46:23,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:23,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378423136] [2023-08-24 08:46:23,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:23,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:24,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:24,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378423136] [2023-08-24 08:46:24,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378423136] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:24,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:24,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:24,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754606261] [2023-08-24 08:46:24,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:24,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:24,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:24,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:24,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:24,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:24,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 290 transitions, 4727 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:24,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:24,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:24,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:25,879 INFO L124 PetriNetUnfolderBase]: 13387/17607 cut-off events. [2023-08-24 08:46:25,879 INFO L125 PetriNetUnfolderBase]: For 287737/290377 co-relation queries the response was YES. [2023-08-24 08:46:25,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125958 conditions, 17607 events. 13387/17607 cut-off events. For 287737/290377 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 88932 event pairs, 3664 based on Foata normal form. 1933/19022 useless extension candidates. Maximal degree in co-relation 116330. Up to 14781 conditions per place. [2023-08-24 08:46:26,008 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 331 selfloop transitions, 49 changer transitions 4/399 dead transitions. [2023-08-24 08:46:26,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 399 transitions, 6965 flow [2023-08-24 08:46:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-08-24 08:46:26,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47904761904761906 [2023-08-24 08:46:26,010 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-08-24 08:46:26,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-08-24 08:46:26,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:26,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-08-24 08:46:26,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:26,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:26,012 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:26,012 INFO L175 Difference]: Start difference. First operand has 112 places, 290 transitions, 4727 flow. Second operand 5 states and 503 transitions. [2023-08-24 08:46:26,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 399 transitions, 6965 flow [2023-08-24 08:46:27,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 399 transitions, 6674 flow, removed 31 selfloop flow, removed 1 redundant places. [2023-08-24 08:46:27,072 INFO L231 Difference]: Finished difference. Result has 115 places, 291 transitions, 4610 flow [2023-08-24 08:46:27,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=4500, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4610, PETRI_PLACES=115, PETRI_TRANSITIONS=291} [2023-08-24 08:46:27,072 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 77 predicate places. [2023-08-24 08:46:27,072 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 291 transitions, 4610 flow [2023-08-24 08:46:27,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:27,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:27,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:27,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 08:46:27,073 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:27,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:27,073 INFO L85 PathProgramCache]: Analyzing trace with hash 310949959, now seen corresponding path program 5 times [2023-08-24 08:46:27,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:27,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90269632] [2023-08-24 08:46:27,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:27,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90269632] [2023-08-24 08:46:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90269632] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:46:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141713079] [2023-08-24 08:46:27,118 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 08:46:27,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:46:27,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:46:27,134 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 08:46:27,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 08:46:27,204 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 08:46:27,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 08:46:27,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 08:46:27,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:46:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:27,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:46:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:27,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141713079] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:46:27,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:46:27,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-24 08:46:27,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93339418] [2023-08-24 08:46:27,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:46:27,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 08:46:27,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:27,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 08:46:27,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-24 08:46:27,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:27,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 291 transitions, 4610 flow. Second operand has 10 states, 10 states have (on average 91.3) internal successors, (913), 10 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:27,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:27,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:27,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:28,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][12], [60#L62-4true, 113#L72-4true, Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 701#(= thread1Thread1of1ForFork1_~i~0 0), 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 15#L41-4true, Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, 7#L91-4true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 670#(<= ~N~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 678#(<= 1 ~N~0), Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 496#true, Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), 694#(<= ~N~0 0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 881#(= thread1Thread1of1ForFork1_~i~0 0), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 885#true]) [2023-08-24 08:46:28,006 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,006 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-24 08:46:28,007 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-24 08:46:28,007 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][12], [Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 121#$Ultimate##0true, Black: 670#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 6#thread3EXITtrue, Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 885#true, 879#true, 113#L72-4true, 678#(<= 1 ~N~0), 7#L91-4true, Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 496#true, 694#(<= ~N~0 0)]) [2023-08-24 08:46:28,007 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,007 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-24 08:46:28,008 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-24 08:46:28,008 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][12], [113#L72-4true, 678#(<= 1 ~N~0), Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 701#(= thread1Thread1of1ForFork1_~i~0 0), 15#L41-4true, Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 7#L91-4true, Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 670#(<= ~N~0 0), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 6#thread3EXITtrue, Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), 694#(<= ~N~0 0), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 881#(= thread1Thread1of1ForFork1_~i~0 0), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 885#true]) [2023-08-24 08:46:28,169 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,169 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,169 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,169 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,170 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L41-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_7| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_7| 0) (<= v_~N~0_41 v_thread1Thread1of1ForFork1_~i~0_32)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32, ~N~0=v_~N~0_41} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_7|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_7|, ~N~0=v_~N~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset][5], [879#true, 111#L51-4true, 139#(<= ~N~0 0), 113#L72-4true, 678#(<= 1 ~N~0), Black: 133#(= ~counter2~0 ~counter1~0), 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, 7#L91-4true, Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 670#(<= ~N~0 0), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 686#(<= ~N~0 0), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 6#thread3EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 491#(<= ~N~0 0), 34#thread1EXITtrue, Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 694#(<= ~N~0 0), 885#true]) [2023-08-24 08:46:28,170 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,170 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,170 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,170 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][12], [60#L62-4true, 113#L72-4true, 88#L92-1true, Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 701#(= thread1Thread1of1ForFork1_~i~0 0), 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 15#L41-4true, Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 670#(<= ~N~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 678#(<= 1 ~N~0), Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 496#true, Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), 694#(<= ~N~0 0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 881#(= thread1Thread1of1ForFork1_~i~0 0), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 885#true]) [2023-08-24 08:46:28,229 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,229 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,229 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,229 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][12], [Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 121#$Ultimate##0true, Black: 670#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 6#thread3EXITtrue, Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 885#true, 879#true, 113#L72-4true, 678#(<= 1 ~N~0), 88#L92-1true, Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 694#(<= ~N~0 0)]) [2023-08-24 08:46:28,230 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,230 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,230 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,230 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][12], [113#L72-4true, Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 701#(= thread1Thread1of1ForFork1_~i~0 0), 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 15#L41-4true, Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, 7#L91-4true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 670#(<= ~N~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, 6#thread3EXITtrue, Black: 678#(<= 1 ~N~0), Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 496#true, Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), 694#(<= ~N~0 0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 881#(= thread1Thread1of1ForFork1_~i~0 0), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 885#true]) [2023-08-24 08:46:28,231 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,231 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,231 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,231 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 08:46:28,285 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][22], [879#true, 60#L62-4true, 113#L72-4true, 678#(<= 1 ~N~0), Black: 133#(= ~counter2~0 ~counter1~0), 47#L92-2true, 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 670#(<= ~N~0 0), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 686#(<= ~N~0 0), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), 694#(<= ~N~0 0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 885#true]) [2023-08-24 08:46:28,285 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 08:46:28,285 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 08:46:28,285 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 08:46:28,286 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 08:46:28,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][12], [113#L72-4true, 678#(<= 1 ~N~0), Black: 133#(= ~counter2~0 ~counter1~0), 88#L92-1true, 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 701#(= thread1Thread1of1ForFork1_~i~0 0), 15#L41-4true, Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 670#(<= ~N~0 0), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 6#thread3EXITtrue, Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), 694#(<= ~N~0 0), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 881#(= thread1Thread1of1ForFork1_~i~0 0), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 885#true]) [2023-08-24 08:46:28,389 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 08:46:28,389 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,389 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,389 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L41-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_7| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_7| 0) (<= v_~N~0_41 v_thread1Thread1of1ForFork1_~i~0_32)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_32, ~N~0=v_~N~0_41} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_7|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_7|, ~N~0=v_~N~0_41} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset][5], [879#true, 111#L51-4true, 139#(<= ~N~0 0), 113#L72-4true, 678#(<= 1 ~N~0), Black: 133#(= ~counter2~0 ~counter1~0), 88#L92-1true, 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 670#(<= ~N~0 0), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 686#(<= ~N~0 0), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 6#thread3EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 491#(<= ~N~0 0), 34#thread1EXITtrue, Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 694#(<= ~N~0 0), 885#true]) [2023-08-24 08:46:28,389 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 08:46:28,389 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,389 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,389 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][12], [113#L72-4true, 88#L92-1true, Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 701#(= thread1Thread1of1ForFork1_~i~0 0), 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 15#L41-4true, Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 670#(<= ~N~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, 6#thread3EXITtrue, Black: 678#(<= 1 ~N~0), Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), 694#(<= ~N~0 0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 881#(= thread1Thread1of1ForFork1_~i~0 0), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 885#true]) [2023-08-24 08:46:28,428 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 08:46:28,428 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,429 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,429 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 08:46:28,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][22], [879#true, 113#L72-4true, 678#(<= 1 ~N~0), Black: 133#(= ~counter2~0 ~counter1~0), 47#L92-2true, 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 670#(<= ~N~0 0), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 686#(<= ~N~0 0), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 6#thread3EXITtrue, Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), 694#(<= ~N~0 0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 885#true]) [2023-08-24 08:46:28,632 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 08:46:28,633 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:46:28,633 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:46:28,633 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:46:28,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][22], [879#true, 60#L62-4true, 113#L72-4true, 678#(<= 1 ~N~0), Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), 94#L93-1true, Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 670#(<= ~N~0 0), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 686#(<= ~N~0 0), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), 694#(<= ~N~0 0), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 885#true]) [2023-08-24 08:46:28,633 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 08:46:28,633 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:46:28,633 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:46:28,633 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:46:28,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][22], [879#true, 113#L72-4true, 678#(<= 1 ~N~0), Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), 94#L93-1true, Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 670#(<= ~N~0 0), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 686#(<= ~N~0 0), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 6#thread3EXITtrue, Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), 694#(<= ~N~0 0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 885#true]) [2023-08-24 08:46:28,769 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-24 08:46:28,769 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 08:46:28,769 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 08:46:28,769 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 08:46:29,038 INFO L124 PetriNetUnfolderBase]: 13446/17742 cut-off events. [2023-08-24 08:46:29,039 INFO L125 PetriNetUnfolderBase]: For 272389/274979 co-relation queries the response was YES. [2023-08-24 08:46:29,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122449 conditions, 17742 events. 13446/17742 cut-off events. For 272389/274979 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 90062 event pairs, 2499 based on Foata normal form. 2040/19299 useless extension candidates. Maximal degree in co-relation 113839. Up to 9808 conditions per place. [2023-08-24 08:46:29,146 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 153 selfloop transitions, 277 changer transitions 3/448 dead transitions. [2023-08-24 08:46:29,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 448 transitions, 7829 flow [2023-08-24 08:46:29,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 08:46:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 08:46:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-08-24 08:46:29,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2023-08-24 08:46:29,148 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-08-24 08:46:29,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-08-24 08:46:29,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:29,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-08-24 08:46:29,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:29,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:29,151 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:29,151 INFO L175 Difference]: Start difference. First operand has 115 places, 291 transitions, 4610 flow. Second operand 6 states and 606 transitions. [2023-08-24 08:46:29,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 448 transitions, 7829 flow [2023-08-24 08:46:30,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 448 transitions, 7717 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-24 08:46:30,510 INFO L231 Difference]: Finished difference. Result has 120 places, 367 transitions, 6979 flow [2023-08-24 08:46:30,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=4510, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6979, PETRI_PLACES=120, PETRI_TRANSITIONS=367} [2023-08-24 08:46:30,510 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 82 predicate places. [2023-08-24 08:46:30,510 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 367 transitions, 6979 flow [2023-08-24 08:46:30,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.3) internal successors, (913), 10 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:30,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:30,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:30,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 08:46:30,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 08:46:30,716 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:30,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash 115981662, now seen corresponding path program 4 times [2023-08-24 08:46:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:30,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215072338] [2023-08-24 08:46:30,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:30,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:30,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215072338] [2023-08-24 08:46:30,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215072338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:30,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:30,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:30,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125036475] [2023-08-24 08:46:30,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:30,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:30,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:30,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:30,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:30,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:30,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 367 transitions, 6979 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:30,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:30,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:30,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:32,754 INFO L124 PetriNetUnfolderBase]: 13493/17913 cut-off events. [2023-08-24 08:46:32,754 INFO L125 PetriNetUnfolderBase]: For 288643/291280 co-relation queries the response was YES. [2023-08-24 08:46:32,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129128 conditions, 17913 events. 13493/17913 cut-off events. For 288643/291280 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 92222 event pairs, 2164 based on Foata normal form. 1749/19194 useless extension candidates. Maximal degree in co-relation 119853. Up to 7739 conditions per place. [2023-08-24 08:46:32,990 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 140 selfloop transitions, 274 changer transitions 5/435 dead transitions. [2023-08-24 08:46:32,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 435 transitions, 8419 flow [2023-08-24 08:46:32,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-08-24 08:46:32,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876190476190476 [2023-08-24 08:46:32,992 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-08-24 08:46:32,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-08-24 08:46:32,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:32,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-08-24 08:46:32,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:33,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:33,002 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:33,002 INFO L175 Difference]: Start difference. First operand has 120 places, 367 transitions, 6979 flow. Second operand 5 states and 512 transitions. [2023-08-24 08:46:33,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 435 transitions, 8419 flow [2023-08-24 08:46:34,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 435 transitions, 7469 flow, removed 340 selfloop flow, removed 1 redundant places. [2023-08-24 08:46:34,624 INFO L231 Difference]: Finished difference. Result has 125 places, 371 transitions, 6671 flow [2023-08-24 08:46:34,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=6029, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6671, PETRI_PLACES=125, PETRI_TRANSITIONS=371} [2023-08-24 08:46:34,625 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 87 predicate places. [2023-08-24 08:46:34,625 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 371 transitions, 6671 flow [2023-08-24 08:46:34,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:34,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:34,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:34,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 08:46:34,625 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:34,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:34,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1229138370, now seen corresponding path program 3 times [2023-08-24 08:46:34,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:34,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429575725] [2023-08-24 08:46:34,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:34,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:34,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:34,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429575725] [2023-08-24 08:46:34,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429575725] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:34,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:34,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070294224] [2023-08-24 08:46:34,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:34,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:34,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:34,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:34,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 371 transitions, 6671 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:34,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:34,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:34,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:36,895 INFO L124 PetriNetUnfolderBase]: 13753/18398 cut-off events. [2023-08-24 08:46:36,895 INFO L125 PetriNetUnfolderBase]: For 331776/333997 co-relation queries the response was YES. [2023-08-24 08:46:36,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131239 conditions, 18398 events. 13753/18398 cut-off events. For 331776/333997 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 97175 event pairs, 2007 based on Foata normal form. 1976/19931 useless extension candidates. Maximal degree in co-relation 122286. Up to 9804 conditions per place. [2023-08-24 08:46:37,006 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 454 selfloop transitions, 25 changer transitions 25/520 dead transitions. [2023-08-24 08:46:37,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 520 transitions, 9598 flow [2023-08-24 08:46:37,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2023-08-24 08:46:37,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2023-08-24 08:46:37,008 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2023-08-24 08:46:37,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2023-08-24 08:46:37,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:37,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2023-08-24 08:46:37,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:37,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:37,010 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:37,010 INFO L175 Difference]: Start difference. First operand has 125 places, 371 transitions, 6671 flow. Second operand 5 states and 516 transitions. [2023-08-24 08:46:37,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 520 transitions, 9598 flow [2023-08-24 08:46:38,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 520 transitions, 9002 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 08:46:38,582 INFO L231 Difference]: Finished difference. Result has 129 places, 376 transitions, 6398 flow [2023-08-24 08:46:38,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=6145, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6398, PETRI_PLACES=129, PETRI_TRANSITIONS=376} [2023-08-24 08:46:38,582 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 91 predicate places. [2023-08-24 08:46:38,583 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 376 transitions, 6398 flow [2023-08-24 08:46:38,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:38,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:38,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:38,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 08:46:38,583 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:38,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:38,583 INFO L85 PathProgramCache]: Analyzing trace with hash -505466806, now seen corresponding path program 5 times [2023-08-24 08:46:38,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:38,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255723876] [2023-08-24 08:46:38,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:38,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:38,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:38,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255723876] [2023-08-24 08:46:38,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255723876] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:38,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:38,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:38,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920823272] [2023-08-24 08:46:38,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:38,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:38,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:38,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:38,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:38,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:38,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 376 transitions, 6398 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:38,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:38,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:38,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:40,812 INFO L124 PetriNetUnfolderBase]: 13896/18470 cut-off events. [2023-08-24 08:46:40,813 INFO L125 PetriNetUnfolderBase]: For 325825/328472 co-relation queries the response was YES. [2023-08-24 08:46:40,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132208 conditions, 18470 events. 13896/18470 cut-off events. For 325825/328472 co-relation queries the response was YES. Maximal size of possible extension queue 949. Compared 96678 event pairs, 3334 based on Foata normal form. 2187/20120 useless extension candidates. Maximal degree in co-relation 123677. Up to 14732 conditions per place. [2023-08-24 08:46:40,931 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 385 selfloop transitions, 56 changer transitions 4/461 dead transitions. [2023-08-24 08:46:40,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 461 transitions, 8092 flow [2023-08-24 08:46:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-24 08:46:40,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-08-24 08:46:40,933 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-24 08:46:40,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-24 08:46:40,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:40,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-24 08:46:40,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:40,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:40,935 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:40,935 INFO L175 Difference]: Start difference. First operand has 129 places, 376 transitions, 6398 flow. Second operand 5 states and 507 transitions. [2023-08-24 08:46:40,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 461 transitions, 8092 flow [2023-08-24 08:46:42,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 461 transitions, 7996 flow, removed 31 selfloop flow, removed 2 redundant places. [2023-08-24 08:46:42,605 INFO L231 Difference]: Finished difference. Result has 131 places, 377 transitions, 6431 flow [2023-08-24 08:46:42,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=6304, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6431, PETRI_PLACES=131, PETRI_TRANSITIONS=377} [2023-08-24 08:46:42,606 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 93 predicate places. [2023-08-24 08:46:42,606 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 377 transitions, 6431 flow [2023-08-24 08:46:42,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:42,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:42,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:42,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-24 08:46:42,606 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:42,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1895011962, now seen corresponding path program 4 times [2023-08-24 08:46:42,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:42,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754045160] [2023-08-24 08:46:42,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:42,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:42,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:42,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754045160] [2023-08-24 08:46:42,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754045160] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:42,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:42,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:42,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302216936] [2023-08-24 08:46:42,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:42,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:42,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:42,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:42,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:42,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:42,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 377 transitions, 6431 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:42,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:42,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:42,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:44,819 INFO L124 PetriNetUnfolderBase]: 14952/20192 cut-off events. [2023-08-24 08:46:44,819 INFO L125 PetriNetUnfolderBase]: For 294627/296084 co-relation queries the response was YES. [2023-08-24 08:46:44,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140355 conditions, 20192 events. 14952/20192 cut-off events. For 294627/296084 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 107435 event pairs, 2361 based on Foata normal form. 1468/21515 useless extension candidates. Maximal degree in co-relation 128512. Up to 8753 conditions per place. [2023-08-24 08:46:45,148 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 147 selfloop transitions, 276 changer transitions 10/444 dead transitions. [2023-08-24 08:46:45,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 444 transitions, 7886 flow [2023-08-24 08:46:45,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2023-08-24 08:46:45,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2023-08-24 08:46:45,150 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2023-08-24 08:46:45,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2023-08-24 08:46:45,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:45,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2023-08-24 08:46:45,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:45,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:45,156 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:45,156 INFO L175 Difference]: Start difference. First operand has 131 places, 377 transitions, 6431 flow. Second operand 5 states and 516 transitions. [2023-08-24 08:46:45,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 444 transitions, 7886 flow [2023-08-24 08:46:47,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 444 transitions, 7792 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 08:46:47,024 INFO L231 Difference]: Finished difference. Result has 135 places, 377 transitions, 7149 flow [2023-08-24 08:46:47,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=6349, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7149, PETRI_PLACES=135, PETRI_TRANSITIONS=377} [2023-08-24 08:46:47,025 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 97 predicate places. [2023-08-24 08:46:47,025 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 377 transitions, 7149 flow [2023-08-24 08:46:47,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:47,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:47,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:47,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-24 08:46:47,026 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:47,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1196799427, now seen corresponding path program 5 times [2023-08-24 08:46:47,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:47,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955606918] [2023-08-24 08:46:47,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:47,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:47,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955606918] [2023-08-24 08:46:47,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955606918] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:47,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:47,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:47,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806224054] [2023-08-24 08:46:47,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:47,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:47,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:47,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:47,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:47,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 377 transitions, 7149 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:47,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:47,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:47,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:50,000 INFO L124 PetriNetUnfolderBase]: 17005/22648 cut-off events. [2023-08-24 08:46:50,000 INFO L125 PetriNetUnfolderBase]: For 445231/449454 co-relation queries the response was YES. [2023-08-24 08:46:50,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163014 conditions, 22648 events. 17005/22648 cut-off events. For 445231/449454 co-relation queries the response was YES. Maximal size of possible extension queue 1200. Compared 119726 event pairs, 4214 based on Foata normal form. 2252/24642 useless extension candidates. Maximal degree in co-relation 151532. Up to 17634 conditions per place. [2023-08-24 08:46:50,201 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 468 selfloop transitions, 58 changer transitions 16/566 dead transitions. [2023-08-24 08:46:50,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 566 transitions, 11089 flow [2023-08-24 08:46:50,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2023-08-24 08:46:50,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2023-08-24 08:46:50,202 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2023-08-24 08:46:50,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2023-08-24 08:46:50,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:50,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2023-08-24 08:46:50,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:50,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:50,204 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:50,204 INFO L175 Difference]: Start difference. First operand has 135 places, 377 transitions, 7149 flow. Second operand 5 states and 505 transitions. [2023-08-24 08:46:50,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 566 transitions, 11089 flow [2023-08-24 08:46:52,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 566 transitions, 10639 flow, removed 28 selfloop flow, removed 2 redundant places. [2023-08-24 08:46:52,788 INFO L231 Difference]: Finished difference. Result has 140 places, 415 transitions, 7519 flow [2023-08-24 08:46:52,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=6811, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7519, PETRI_PLACES=140, PETRI_TRANSITIONS=415} [2023-08-24 08:46:52,789 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 102 predicate places. [2023-08-24 08:46:52,789 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 415 transitions, 7519 flow [2023-08-24 08:46:52,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:52,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:52,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:52,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-24 08:46:52,790 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:52,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:52,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1131469262, now seen corresponding path program 5 times [2023-08-24 08:46:52,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:52,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395488110] [2023-08-24 08:46:52,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:52,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:52,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:52,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395488110] [2023-08-24 08:46:52,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395488110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:52,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:52,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:52,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552831389] [2023-08-24 08:46:52,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:52,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:52,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:52,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:52,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:52,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:52,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 415 transitions, 7519 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:52,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:52,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:52,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:46:55,736 INFO L124 PetriNetUnfolderBase]: 16965/22655 cut-off events. [2023-08-24 08:46:55,737 INFO L125 PetriNetUnfolderBase]: For 474786/478224 co-relation queries the response was YES. [2023-08-24 08:46:55,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174775 conditions, 22655 events. 16965/22655 cut-off events. For 474786/478224 co-relation queries the response was YES. Maximal size of possible extension queue 1164. Compared 121423 event pairs, 3777 based on Foata normal form. 2186/24233 useless extension candidates. Maximal degree in co-relation 163942. Up to 17576 conditions per place. [2023-08-24 08:46:55,893 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 457 selfloop transitions, 57 changer transitions 0/535 dead transitions. [2023-08-24 08:46:55,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 535 transitions, 10011 flow [2023-08-24 08:46:55,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:46:55,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:46:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-24 08:46:55,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847619047619048 [2023-08-24 08:46:55,894 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-24 08:46:55,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-24 08:46:55,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:46:55,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-24 08:46:55,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:55,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:55,896 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:55,896 INFO L175 Difference]: Start difference. First operand has 140 places, 415 transitions, 7519 flow. Second operand 5 states and 509 transitions. [2023-08-24 08:46:55,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 535 transitions, 10011 flow [2023-08-24 08:46:58,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 535 transitions, 9842 flow, removed 50 selfloop flow, removed 1 redundant places. [2023-08-24 08:46:58,274 INFO L231 Difference]: Finished difference. Result has 143 places, 416 transitions, 7561 flow [2023-08-24 08:46:58,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=7434, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7561, PETRI_PLACES=143, PETRI_TRANSITIONS=416} [2023-08-24 08:46:58,275 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 105 predicate places. [2023-08-24 08:46:58,275 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 416 transitions, 7561 flow [2023-08-24 08:46:58,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:58,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:46:58,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:46:58,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-24 08:46:58,275 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:46:58,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:46:58,275 INFO L85 PathProgramCache]: Analyzing trace with hash -586489875, now seen corresponding path program 6 times [2023-08-24 08:46:58,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:46:58,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11741310] [2023-08-24 08:46:58,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:46:58,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:46:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:46:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:46:58,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:46:58,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11741310] [2023-08-24 08:46:58,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11741310] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:46:58,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:46:58,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:46:58,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609827558] [2023-08-24 08:46:58,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:46:58,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:46:58,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:46:58,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:46:58,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:46:58,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:46:58,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 416 transitions, 7561 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:46:58,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:46:58,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:46:58,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:47:02,045 INFO L124 PetriNetUnfolderBase]: 22715/30267 cut-off events. [2023-08-24 08:47:02,046 INFO L125 PetriNetUnfolderBase]: For 618156/622905 co-relation queries the response was YES. [2023-08-24 08:47:02,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230820 conditions, 30267 events. 22715/30267 cut-off events. For 618156/622905 co-relation queries the response was YES. Maximal size of possible extension queue 1582. Compared 167423 event pairs, 4146 based on Foata normal form. 2653/32603 useless extension candidates. Maximal degree in co-relation 212233. Up to 14829 conditions per place. [2023-08-24 08:47:02,265 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 741 selfloop transitions, 63 changer transitions 25/853 dead transitions. [2023-08-24 08:47:02,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 853 transitions, 17110 flow [2023-08-24 08:47:02,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:47:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:47:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-08-24 08:47:02,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819047619047619 [2023-08-24 08:47:02,266 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-08-24 08:47:02,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-08-24 08:47:02,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:47:02,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-08-24 08:47:02,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:02,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:02,268 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:02,268 INFO L175 Difference]: Start difference. First operand has 143 places, 416 transitions, 7561 flow. Second operand 5 states and 506 transitions. [2023-08-24 08:47:02,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 853 transitions, 17110 flow [2023-08-24 08:47:06,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 853 transitions, 16947 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-24 08:47:06,588 INFO L231 Difference]: Finished difference. Result has 148 places, 427 transitions, 7941 flow [2023-08-24 08:47:06,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=7496, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7941, PETRI_PLACES=148, PETRI_TRANSITIONS=427} [2023-08-24 08:47:06,589 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 110 predicate places. [2023-08-24 08:47:06,589 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 427 transitions, 7941 flow [2023-08-24 08:47:06,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:06,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:47:06,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:47:06,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-24 08:47:06,589 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:47:06,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:47:06,589 INFO L85 PathProgramCache]: Analyzing trace with hash -348828861, now seen corresponding path program 7 times [2023-08-24 08:47:06,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:47:06,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889961996] [2023-08-24 08:47:06,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:47:06,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:47:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:47:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:47:06,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:47:06,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889961996] [2023-08-24 08:47:06,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889961996] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:47:06,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:47:06,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:47:06,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083481688] [2023-08-24 08:47:06,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:47:06,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:47:06,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:47:06,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:47:06,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:47:06,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:47:06,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 427 transitions, 7941 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:06,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:47:06,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:47:06,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:47:08,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][12], [1063#(<= ~N~0 0), Black: 133#(= ~counter2~0 ~counter1~0), 1106#true, 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), 15#L41-4true, Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 887#(= thread3Thread1of1ForFork0_~i~2 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 888#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1046#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 670#(<= ~N~0 0), Black: 1055#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 1056#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 6#thread3EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1064#(and (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1077#(<= 1 ~N~0), Black: 1085#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1084#(= thread1Thread1of1ForFork1_~i~0 0), 113#L72-4true, Black: 1086#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 678#(<= 1 ~N~0), 1099#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 88#L92-1true, 1078#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= 1 ~N~0)), Black: 1100#(<= ~N~0 0), Black: 1101#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 716#(<= 0 thread1Thread1of1ForFork1_~i~0), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 694#(<= ~N~0 0)]) [2023-08-24 08:47:08,768 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 08:47:08,768 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 08:47:08,768 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 08:47:08,768 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 08:47:09,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][12], [1063#(<= ~N~0 0), Black: 133#(= ~counter2~0 ~counter1~0), 1106#true, 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 887#(= thread3Thread1of1ForFork0_~i~2 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 888#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1046#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 670#(<= ~N~0 0), Black: 1055#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 1056#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 6#thread3EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1064#(and (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1077#(<= 1 ~N~0), Black: 1085#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1084#(= thread1Thread1of1ForFork1_~i~0 0), 113#L72-4true, Black: 1086#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 678#(<= 1 ~N~0), 1099#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 88#L92-1true, 1078#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= 1 ~N~0)), Black: 1100#(<= ~N~0 0), Black: 1101#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 316#(<= 1 ~N~0), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, 34#thread1EXITtrue, 694#(<= ~N~0 0)]) [2023-08-24 08:47:09,171 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 08:47:09,171 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:47:09,171 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:47:09,171 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:47:09,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][12], [1063#(<= ~N~0 0), Black: 133#(= ~counter2~0 ~counter1~0), 1106#true, 47#L92-2true, 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 887#(= thread3Thread1of1ForFork0_~i~2 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 888#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1046#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 670#(<= ~N~0 0), Black: 1055#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 1056#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 6#thread3EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1064#(and (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1077#(<= 1 ~N~0), Black: 1085#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1084#(= thread1Thread1of1ForFork1_~i~0 0), 113#L72-4true, Black: 1086#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 678#(<= 1 ~N~0), 1099#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 1078#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= 1 ~N~0)), Black: 1100#(<= ~N~0 0), Black: 1101#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 316#(<= 1 ~N~0), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, 694#(<= ~N~0 0)]) [2023-08-24 08:47:09,709 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-24 08:47:09,709 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 08:47:09,709 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 08:47:09,709 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 08:47:09,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][12], [1063#(<= ~N~0 0), Black: 133#(= ~counter2~0 ~counter1~0), 1106#true, 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 887#(= thread3Thread1of1ForFork0_~i~2 0), Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 888#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1046#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 670#(<= ~N~0 0), Black: 1055#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 1056#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 6#thread3EXITtrue, Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1064#(and (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1077#(<= 1 ~N~0), Black: 1085#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1084#(= thread1Thread1of1ForFork1_~i~0 0), 113#L72-4true, Black: 1086#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 678#(<= 1 ~N~0), 1099#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 1078#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= 1 ~N~0)), Black: 1100#(<= ~N~0 0), 94#L93-1true, Black: 1101#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 316#(<= 1 ~N~0), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, 694#(<= ~N~0 0)]) [2023-08-24 08:47:09,980 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-24 08:47:09,980 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 08:47:09,980 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 08:47:09,980 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 08:47:10,410 INFO L124 PetriNetUnfolderBase]: 21850/29321 cut-off events. [2023-08-24 08:47:10,410 INFO L125 PetriNetUnfolderBase]: For 672575/676174 co-relation queries the response was YES. [2023-08-24 08:47:10,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236887 conditions, 29321 events. 21850/29321 cut-off events. For 672575/676174 co-relation queries the response was YES. Maximal size of possible extension queue 1516. Compared 165115 event pairs, 4126 based on Foata normal form. 3004/31870 useless extension candidates. Maximal degree in co-relation 221299. Up to 12046 conditions per place. [2023-08-24 08:47:10,840 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 205 selfloop transitions, 280 changer transitions 8/515 dead transitions. [2023-08-24 08:47:10,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 515 transitions, 10138 flow [2023-08-24 08:47:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:47:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:47:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-08-24 08:47:10,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-08-24 08:47:10,850 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-08-24 08:47:10,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-08-24 08:47:10,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:47:10,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-08-24 08:47:10,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:10,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:10,866 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:10,866 INFO L175 Difference]: Start difference. First operand has 148 places, 427 transitions, 7941 flow. Second operand 5 states and 510 transitions. [2023-08-24 08:47:10,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 515 transitions, 10138 flow [2023-08-24 08:47:14,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 515 transitions, 9950 flow, removed 76 selfloop flow, removed 1 redundant places. [2023-08-24 08:47:14,498 INFO L231 Difference]: Finished difference. Result has 153 places, 433 transitions, 8590 flow [2023-08-24 08:47:14,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=7875, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8590, PETRI_PLACES=153, PETRI_TRANSITIONS=433} [2023-08-24 08:47:14,499 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 115 predicate places. [2023-08-24 08:47:14,499 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 433 transitions, 8590 flow [2023-08-24 08:47:14,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:14,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:47:14,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:47:14,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-24 08:47:14,499 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:47:14,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:47:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2143608274, now seen corresponding path program 6 times [2023-08-24 08:47:14,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:47:14,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901752013] [2023-08-24 08:47:14,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:47:14,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:47:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:47:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:47:14,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:47:14,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901752013] [2023-08-24 08:47:14,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901752013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:47:14,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:47:14,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:47:14,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228462367] [2023-08-24 08:47:14,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:47:14,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:47:14,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:47:14,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:47:14,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:47:14,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:47:14,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 433 transitions, 8590 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:14,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:47:14,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:47:14,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:47:18,644 INFO L124 PetriNetUnfolderBase]: 22601/30152 cut-off events. [2023-08-24 08:47:18,644 INFO L125 PetriNetUnfolderBase]: For 710369/714636 co-relation queries the response was YES. [2023-08-24 08:47:18,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230846 conditions, 30152 events. 22601/30152 cut-off events. For 710369/714636 co-relation queries the response was YES. Maximal size of possible extension queue 1614. Compared 167659 event pairs, 6349 based on Foata normal form. 3821/33414 useless extension candidates. Maximal degree in co-relation 213336. Up to 24451 conditions per place. [2023-08-24 08:47:18,931 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 411 selfloop transitions, 87 changer transitions 2/522 dead transitions. [2023-08-24 08:47:18,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 522 transitions, 10636 flow [2023-08-24 08:47:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:47:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:47:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2023-08-24 08:47:18,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2023-08-24 08:47:18,932 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2023-08-24 08:47:18,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2023-08-24 08:47:18,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:47:18,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2023-08-24 08:47:18,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:18,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:18,934 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:18,934 INFO L175 Difference]: Start difference. First operand has 153 places, 433 transitions, 8590 flow. Second operand 5 states and 505 transitions. [2023-08-24 08:47:18,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 522 transitions, 10636 flow [2023-08-24 08:47:21,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 522 transitions, 10089 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-24 08:47:21,937 INFO L231 Difference]: Finished difference. Result has 155 places, 435 transitions, 8253 flow [2023-08-24 08:47:21,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=8043, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8253, PETRI_PLACES=155, PETRI_TRANSITIONS=435} [2023-08-24 08:47:21,938 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 117 predicate places. [2023-08-24 08:47:21,938 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 435 transitions, 8253 flow [2023-08-24 08:47:21,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:21,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:47:21,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:47:21,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-24 08:47:21,938 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:47:21,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:47:21,938 INFO L85 PathProgramCache]: Analyzing trace with hash -539745269, now seen corresponding path program 6 times [2023-08-24 08:47:21,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:47:21,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573240662] [2023-08-24 08:47:21,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:47:21,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:47:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:47:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:47:21,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:47:21,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573240662] [2023-08-24 08:47:21,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573240662] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:47:21,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:47:21,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:47:21,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216019712] [2023-08-24 08:47:21,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:47:21,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:47:21,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:47:21,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:47:21,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:47:21,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:47:21,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 435 transitions, 8253 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:21,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:47:21,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:47:21,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:47:26,191 INFO L124 PetriNetUnfolderBase]: 23131/30987 cut-off events. [2023-08-24 08:47:26,191 INFO L125 PetriNetUnfolderBase]: For 647626/652805 co-relation queries the response was YES. [2023-08-24 08:47:26,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232708 conditions, 30987 events. 23131/30987 cut-off events. For 647626/652805 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 175203 event pairs, 5256 based on Foata normal form. 2777/33416 useless extension candidates. Maximal degree in co-relation 214470. Up to 21326 conditions per place. [2023-08-24 08:47:26,455 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 621 selfloop transitions, 93 changer transitions 19/757 dead transitions. [2023-08-24 08:47:26,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 757 transitions, 15713 flow [2023-08-24 08:47:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:47:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:47:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2023-08-24 08:47:26,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2023-08-24 08:47:26,456 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2023-08-24 08:47:26,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2023-08-24 08:47:26,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:47:26,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2023-08-24 08:47:26,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:26,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:26,458 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:26,458 INFO L175 Difference]: Start difference. First operand has 155 places, 435 transitions, 8253 flow. Second operand 5 states and 505 transitions. [2023-08-24 08:47:26,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 757 transitions, 15713 flow [2023-08-24 08:47:31,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 757 transitions, 15613 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-24 08:47:31,255 INFO L231 Difference]: Finished difference. Result has 160 places, 474 transitions, 9228 flow [2023-08-24 08:47:31,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=8186, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9228, PETRI_PLACES=160, PETRI_TRANSITIONS=474} [2023-08-24 08:47:31,256 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 122 predicate places. [2023-08-24 08:47:31,256 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 474 transitions, 9228 flow [2023-08-24 08:47:31,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:31,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:47:31,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:47:31,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-24 08:47:31,257 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:47:31,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:47:31,257 INFO L85 PathProgramCache]: Analyzing trace with hash 671135343, now seen corresponding path program 7 times [2023-08-24 08:47:31,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:47:31,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700441980] [2023-08-24 08:47:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:47:31,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:47:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:47:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:47:31,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:47:31,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700441980] [2023-08-24 08:47:31,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700441980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:47:31,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:47:31,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:47:31,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613999629] [2023-08-24 08:47:31,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:47:31,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:47:31,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:47:31,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:47:31,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:47:31,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:47:31,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 474 transitions, 9228 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:31,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:47:31,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:47:31,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:47:35,785 INFO L124 PetriNetUnfolderBase]: 24136/32352 cut-off events. [2023-08-24 08:47:35,785 INFO L125 PetriNetUnfolderBase]: For 697632/702543 co-relation queries the response was YES. [2023-08-24 08:47:35,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249686 conditions, 32352 events. 24136/32352 cut-off events. For 697632/702543 co-relation queries the response was YES. Maximal size of possible extension queue 1729. Compared 184092 event pairs, 3353 based on Foata normal form. 2841/34900 useless extension candidates. Maximal degree in co-relation 229939. Up to 13150 conditions per place. [2023-08-24 08:47:36,258 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 744 selfloop transitions, 79 changer transitions 28/875 dead transitions. [2023-08-24 08:47:36,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 875 transitions, 18431 flow [2023-08-24 08:47:36,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:47:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:47:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-08-24 08:47:36,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838095238095238 [2023-08-24 08:47:36,266 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-08-24 08:47:36,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-08-24 08:47:36,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:47:36,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-08-24 08:47:36,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:36,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:36,279 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:36,279 INFO L175 Difference]: Start difference. First operand has 160 places, 474 transitions, 9228 flow. Second operand 5 states and 508 transitions. [2023-08-24 08:47:36,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 875 transitions, 18431 flow [2023-08-24 08:47:42,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 875 transitions, 18145 flow, removed 72 selfloop flow, removed 2 redundant places. [2023-08-24 08:47:42,820 INFO L231 Difference]: Finished difference. Result has 164 places, 480 transitions, 9274 flow [2023-08-24 08:47:42,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=8942, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9274, PETRI_PLACES=164, PETRI_TRANSITIONS=480} [2023-08-24 08:47:42,821 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 126 predicate places. [2023-08-24 08:47:42,821 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 480 transitions, 9274 flow [2023-08-24 08:47:42,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:42,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:47:42,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:47:42,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-24 08:47:42,821 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:47:42,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:47:42,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1969810878, now seen corresponding path program 7 times [2023-08-24 08:47:42,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:47:42,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331732857] [2023-08-24 08:47:42,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:47:42,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:47:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:47:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:47:42,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:47:42,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331732857] [2023-08-24 08:47:42,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331732857] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:47:42,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:47:42,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:47:42,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881860048] [2023-08-24 08:47:42,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:47:42,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:47:42,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:47:42,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:47:42,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:47:42,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:47:42,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 480 transitions, 9274 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:42,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:47:42,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:47:42,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:47:47,397 INFO L124 PetriNetUnfolderBase]: 23640/32066 cut-off events. [2023-08-24 08:47:47,398 INFO L125 PetriNetUnfolderBase]: For 707721/710073 co-relation queries the response was YES. [2023-08-24 08:47:47,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245733 conditions, 32066 events. 23640/32066 cut-off events. For 707721/710073 co-relation queries the response was YES. Maximal size of possible extension queue 1699. Compared 184861 event pairs, 4453 based on Foata normal form. 2360/34114 useless extension candidates. Maximal degree in co-relation 227334. Up to 15505 conditions per place. [2023-08-24 08:47:47,918 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 750 selfloop transitions, 79 changer transitions 61/915 dead transitions. [2023-08-24 08:47:47,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 915 transitions, 19209 flow [2023-08-24 08:47:47,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:47:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:47:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-08-24 08:47:47,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-08-24 08:47:47,919 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-08-24 08:47:47,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-08-24 08:47:47,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:47:47,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-08-24 08:47:47,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:47,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:47,921 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:47,921 INFO L175 Difference]: Start difference. First operand has 164 places, 480 transitions, 9274 flow. Second operand 5 states and 510 transitions. [2023-08-24 08:47:47,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 915 transitions, 19209 flow [2023-08-24 08:47:54,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 915 transitions, 19014 flow, removed 34 selfloop flow, removed 2 redundant places. [2023-08-24 08:47:54,540 INFO L231 Difference]: Finished difference. Result has 168 places, 488 transitions, 9765 flow [2023-08-24 08:47:54,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=9095, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9765, PETRI_PLACES=168, PETRI_TRANSITIONS=488} [2023-08-24 08:47:54,541 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 130 predicate places. [2023-08-24 08:47:54,541 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 488 transitions, 9765 flow [2023-08-24 08:47:54,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:54,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:47:54,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:47:54,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-24 08:47:54,541 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:47:54,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:47:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1749286269, now seen corresponding path program 8 times [2023-08-24 08:47:54,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:47:54,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357843309] [2023-08-24 08:47:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:47:54,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:47:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:47:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:47:54,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:47:54,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357843309] [2023-08-24 08:47:54,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357843309] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:47:54,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:47:54,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:47:54,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773111398] [2023-08-24 08:47:54,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:47:54,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:47:54,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:47:54,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:47:54,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:47:54,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:47:54,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 488 transitions, 9765 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:47:54,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:47:54,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:47:54,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:47:59,709 INFO L124 PetriNetUnfolderBase]: 25224/33693 cut-off events. [2023-08-24 08:47:59,709 INFO L125 PetriNetUnfolderBase]: For 838320/843891 co-relation queries the response was YES. [2023-08-24 08:47:59,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263157 conditions, 33693 events. 25224/33693 cut-off events. For 838320/843891 co-relation queries the response was YES. Maximal size of possible extension queue 1850. Compared 190647 event pairs, 6255 based on Foata normal form. 2999/36301 useless extension candidates. Maximal degree in co-relation 242921. Up to 25769 conditions per place. [2023-08-24 08:48:00,026 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 484 selfloop transitions, 103 changer transitions 8/621 dead transitions. [2023-08-24 08:48:00,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 621 transitions, 13082 flow [2023-08-24 08:48:00,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:48:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:48:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-08-24 08:48:00,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47714285714285715 [2023-08-24 08:48:00,027 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-08-24 08:48:00,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-08-24 08:48:00,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:48:00,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-08-24 08:48:00,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:00,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:00,029 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:00,029 INFO L175 Difference]: Start difference. First operand has 168 places, 488 transitions, 9765 flow. Second operand 5 states and 501 transitions. [2023-08-24 08:48:00,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 621 transitions, 13082 flow [2023-08-24 08:48:06,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 621 transitions, 12726 flow, removed 127 selfloop flow, removed 2 redundant places. [2023-08-24 08:48:06,553 INFO L231 Difference]: Finished difference. Result has 170 places, 493 transitions, 9760 flow [2023-08-24 08:48:06,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=9457, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9760, PETRI_PLACES=170, PETRI_TRANSITIONS=493} [2023-08-24 08:48:06,557 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 132 predicate places. [2023-08-24 08:48:06,557 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 493 transitions, 9760 flow [2023-08-24 08:48:06,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:06,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:48:06,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:48:06,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-24 08:48:06,558 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:48:06,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:48:06,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1717977964, now seen corresponding path program 8 times [2023-08-24 08:48:06,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:48:06,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381185687] [2023-08-24 08:48:06,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:48:06,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:48:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:48:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:48:06,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:48:06,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381185687] [2023-08-24 08:48:06,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381185687] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:48:06,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:48:06,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:48:06,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916466937] [2023-08-24 08:48:06,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:48:06,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:48:06,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:48:06,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:48:06,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:48:06,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:48:06,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 493 transitions, 9760 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:06,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:48:06,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:48:06,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:48:09,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][19], [1144#true, 1122#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 1063#(<= ~N~0 0), Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), 15#L41-4true, Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 887#(= thread3Thread1of1ForFork0_~i~2 0), Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 888#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1046#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), 1150#true, Black: 670#(<= ~N~0 0), Black: 1055#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 1056#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 6#thread3EXITtrue, Black: 1064#(and (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1077#(<= 1 ~N~0), Black: 1085#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1084#(= thread1Thread1of1ForFork1_~i~0 0), 113#L72-4true, Black: 1086#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 678#(<= 1 ~N~0), 88#L92-1true, 1078#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= 1 ~N~0)), Black: 1100#(<= ~N~0 0), Black: 1101#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1110#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1109#(<= ~N~0 0), 716#(<= 0 thread1Thread1of1ForFork1_~i~0), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 316#(<= 1 ~N~0), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1123#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1132#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, Black: 1131#(<= 1 ~N~0), Black: 1139#(<= ~N~0 0), 694#(<= ~N~0 0), Black: 1140#(and (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0))]) [2023-08-24 08:48:09,575 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 08:48:09,575 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 08:48:09,575 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 08:48:09,575 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 08:48:10,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][19], [1144#true, 1063#(<= ~N~0 0), 1122#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 887#(= thread3Thread1of1ForFork0_~i~2 0), Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 888#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1046#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), 1150#true, Black: 670#(<= ~N~0 0), Black: 1055#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 1056#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 6#thread3EXITtrue, Black: 1064#(and (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1077#(<= 1 ~N~0), Black: 1085#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1084#(= thread1Thread1of1ForFork1_~i~0 0), 113#L72-4true, Black: 1086#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 678#(<= 1 ~N~0), 88#L92-1true, 1078#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= 1 ~N~0)), Black: 1100#(<= ~N~0 0), Black: 1101#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1110#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1109#(<= ~N~0 0), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), 316#(<= 1 ~N~0), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1123#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 41#thread2EXITtrue, Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1132#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 1131#(<= 1 ~N~0), 34#thread1EXITtrue, 694#(<= ~N~0 0), Black: 1139#(<= ~N~0 0), Black: 1140#(and (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0))]) [2023-08-24 08:48:10,256 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 08:48:10,256 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:48:10,256 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:48:10,256 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 08:48:10,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][19], [1144#true, 1063#(<= ~N~0 0), 1122#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 133#(= ~counter2~0 ~counter1~0), 47#L92-2true, 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 887#(= thread3Thread1of1ForFork0_~i~2 0), Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 888#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1046#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), 1150#true, Black: 670#(<= ~N~0 0), Black: 1055#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 1056#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 6#thread3EXITtrue, Black: 1064#(and (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1077#(<= 1 ~N~0), Black: 1085#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1084#(= thread1Thread1of1ForFork1_~i~0 0), 113#L72-4true, Black: 1086#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 678#(<= 1 ~N~0), 1078#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= 1 ~N~0)), Black: 1100#(<= ~N~0 0), Black: 1101#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1110#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1109#(<= ~N~0 0), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), 316#(<= 1 ~N~0), Black: 1123#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1132#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, Black: 1131#(<= 1 ~N~0), 694#(<= ~N~0 0), Black: 1139#(<= ~N~0 0), Black: 1140#(and (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0))]) [2023-08-24 08:48:10,637 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-24 08:48:10,637 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 08:48:10,637 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 08:48:10,637 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 08:48:10,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (<= v_~N~0_43 |v_thread2Thread1of1ForFork3_~i~1#1_28|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_28|, ~N~0=v_~N~0_43} OutVars{thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, ~N~0=v_~N~0_43, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][19], [1144#true, 1122#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 1063#(<= ~N~0 0), Black: 133#(= ~counter2~0 ~counter1~0), 491#(<= ~N~0 0), Black: 139#(<= ~N~0 0), Black: 140#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 138#(= thread1Thread1of1ForFork1_~i~0 0), Black: 526#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 657#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 500#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 530#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), 480#true, Black: 887#(= thread3Thread1of1ForFork0_~i~2 0), Black: 498#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 888#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 499#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1046#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), 1150#true, Black: 670#(<= ~N~0 0), Black: 1055#(<= ~N~0 0), Black: 671#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 1056#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 679#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 6#thread3EXITtrue, Black: 1064#(and (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 686#(<= ~N~0 0), Black: 687#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 147#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 304#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0)), Black: 148#(<= 1 ~N~0), Black: 149#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 306#(and (<= 0 |thread2Thread1of1ForFork3_~i~1#1|) (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 695#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1077#(<= 1 ~N~0), Black: 1085#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1084#(= thread1Thread1of1ForFork1_~i~0 0), 113#L72-4true, Black: 1086#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 678#(<= 1 ~N~0), 1078#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= 1 ~N~0)), 94#L93-1true, Black: 1100#(<= ~N~0 0), Black: 1101#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1110#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1109#(<= ~N~0 0), Black: 474#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 317#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 472#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 701#(= thread1Thread1of1ForFork1_~i~0 0), Black: 729#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 733#(and (<= 1 ~N~0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 702#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 860#(and (<= 1 ~N~0) (<= 0 thread1Thread1of1ForFork1_~i~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 703#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 482#(= thread3Thread1of1ForFork0_~i~2 0), 316#(<= 1 ~N~0), Black: 1123#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 483#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), 41#thread2EXITtrue, Black: 872#(= thread3Thread1of1ForFork0_~i~2 0), Black: 874#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), Black: 873#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1132#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 492#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0)), 496#true, Black: 1131#(<= 1 ~N~0), 694#(<= ~N~0 0), Black: 1139#(<= ~N~0 0), Black: 1140#(and (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0))]) [2023-08-24 08:48:10,893 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-24 08:48:10,893 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 08:48:10,893 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 08:48:10,893 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 08:48:11,543 INFO L124 PetriNetUnfolderBase]: 24809/33446 cut-off events. [2023-08-24 08:48:11,543 INFO L125 PetriNetUnfolderBase]: For 826274/830560 co-relation queries the response was YES. [2023-08-24 08:48:11,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263540 conditions, 33446 events. 24809/33446 cut-off events. For 826274/830560 co-relation queries the response was YES. Maximal size of possible extension queue 1866. Compared 193670 event pairs, 4802 based on Foata normal form. 4131/37044 useless extension candidates. Maximal degree in co-relation 245520. Up to 16641 conditions per place. [2023-08-24 08:48:11,870 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 491 selfloop transitions, 92 changer transitions 26/630 dead transitions. [2023-08-24 08:48:11,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 630 transitions, 13017 flow [2023-08-24 08:48:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:48:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:48:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-24 08:48:11,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2023-08-24 08:48:11,871 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-24 08:48:11,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-24 08:48:11,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:48:11,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-24 08:48:11,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:11,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:11,873 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:11,873 INFO L175 Difference]: Start difference. First operand has 170 places, 493 transitions, 9760 flow. Second operand 5 states and 518 transitions. [2023-08-24 08:48:11,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 630 transitions, 13017 flow [2023-08-24 08:48:17,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 630 transitions, 12771 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-08-24 08:48:17,619 INFO L231 Difference]: Finished difference. Result has 173 places, 500 transitions, 10021 flow [2023-08-24 08:48:17,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=9518, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10021, PETRI_PLACES=173, PETRI_TRANSITIONS=500} [2023-08-24 08:48:17,621 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 135 predicate places. [2023-08-24 08:48:17,621 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 500 transitions, 10021 flow [2023-08-24 08:48:17,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:17,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:48:17,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:48:17,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-24 08:48:17,621 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:48:17,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:48:17,621 INFO L85 PathProgramCache]: Analyzing trace with hash -538516104, now seen corresponding path program 9 times [2023-08-24 08:48:17,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:48:17,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499426099] [2023-08-24 08:48:17,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:48:17,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:48:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:48:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:48:17,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:48:17,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499426099] [2023-08-24 08:48:17,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499426099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:48:17,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:48:17,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:48:17,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248699531] [2023-08-24 08:48:17,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:48:17,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:48:17,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:48:17,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:48:17,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:48:17,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:48:17,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 500 transitions, 10021 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:17,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:48:17,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:48:17,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:48:22,536 INFO L124 PetriNetUnfolderBase]: 24036/32456 cut-off events. [2023-08-24 08:48:22,537 INFO L125 PetriNetUnfolderBase]: For 803888/807881 co-relation queries the response was YES. [2023-08-24 08:48:22,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251981 conditions, 32456 events. 24036/32456 cut-off events. For 803888/807881 co-relation queries the response was YES. Maximal size of possible extension queue 1672. Compared 187503 event pairs, 5203 based on Foata normal form. 3211/34879 useless extension candidates. Maximal degree in co-relation 236712. Up to 24095 conditions per place. [2023-08-24 08:48:22,834 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 566 selfloop transitions, 63 changer transitions 61/720 dead transitions. [2023-08-24 08:48:22,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 720 transitions, 15153 flow [2023-08-24 08:48:22,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:48:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:48:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-24 08:48:22,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847619047619048 [2023-08-24 08:48:22,835 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-24 08:48:22,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-24 08:48:22,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:48:22,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-24 08:48:22,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:22,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:22,837 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:22,837 INFO L175 Difference]: Start difference. First operand has 173 places, 500 transitions, 10021 flow. Second operand 5 states and 509 transitions. [2023-08-24 08:48:22,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 720 transitions, 15153 flow [2023-08-24 08:48:28,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 720 transitions, 14760 flow, removed 55 selfloop flow, removed 2 redundant places. [2023-08-24 08:48:28,511 INFO L231 Difference]: Finished difference. Result has 176 places, 484 transitions, 9699 flow [2023-08-24 08:48:28,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=9661, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9699, PETRI_PLACES=176, PETRI_TRANSITIONS=484} [2023-08-24 08:48:28,521 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 138 predicate places. [2023-08-24 08:48:28,521 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 484 transitions, 9699 flow [2023-08-24 08:48:28,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:28,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:48:28,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:48:28,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-24 08:48:28,521 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:48:28,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:48:28,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2110712002, now seen corresponding path program 6 times [2023-08-24 08:48:28,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:48:28,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705150901] [2023-08-24 08:48:28,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:48:28,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:48:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:48:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:48:28,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:48:28,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705150901] [2023-08-24 08:48:28,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705150901] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:48:28,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:48:28,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:48:28,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087807067] [2023-08-24 08:48:28,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:48:28,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:48:28,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:48:28,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:48:28,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:48:28,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:48:28,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 484 transitions, 9699 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:28,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:48:28,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:48:28,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:48:34,201 INFO L124 PetriNetUnfolderBase]: 26456/35657 cut-off events. [2023-08-24 08:48:34,202 INFO L125 PetriNetUnfolderBase]: For 831159/833821 co-relation queries the response was YES. [2023-08-24 08:48:34,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275865 conditions, 35657 events. 26456/35657 cut-off events. For 831159/833821 co-relation queries the response was YES. Maximal size of possible extension queue 1747. Compared 203764 event pairs, 6256 based on Foata normal form. 1811/37124 useless extension candidates. Maximal degree in co-relation 257670. Up to 24193 conditions per place. [2023-08-24 08:48:34,561 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 650 selfloop transitions, 111 changer transitions 48/849 dead transitions. [2023-08-24 08:48:34,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 849 transitions, 18332 flow [2023-08-24 08:48:34,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:48:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:48:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-08-24 08:48:34,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47904761904761906 [2023-08-24 08:48:34,562 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-08-24 08:48:34,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-08-24 08:48:34,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:48:34,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-08-24 08:48:34,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:34,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:34,564 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:34,564 INFO L175 Difference]: Start difference. First operand has 176 places, 484 transitions, 9699 flow. Second operand 5 states and 503 transitions. [2023-08-24 08:48:34,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 849 transitions, 18332 flow [2023-08-24 08:48:42,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 849 transitions, 17811 flow, removed 107 selfloop flow, removed 3 redundant places. [2023-08-24 08:48:42,765 INFO L231 Difference]: Finished difference. Result has 180 places, 538 transitions, 10813 flow [2023-08-24 08:48:42,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=9456, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10813, PETRI_PLACES=180, PETRI_TRANSITIONS=538} [2023-08-24 08:48:42,767 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2023-08-24 08:48:42,767 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 538 transitions, 10813 flow [2023-08-24 08:48:42,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:42,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:48:42,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:48:42,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-24 08:48:42,767 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:48:42,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:48:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1856399286, now seen corresponding path program 10 times [2023-08-24 08:48:42,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:48:42,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354856378] [2023-08-24 08:48:42,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:48:42,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:48:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:48:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:48:42,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:48:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354856378] [2023-08-24 08:48:42,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354856378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:48:42,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:48:42,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:48:42,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040840111] [2023-08-24 08:48:42,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:48:42,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:48:42,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:48:42,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:48:42,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:48:42,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:48:42,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 538 transitions, 10813 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:42,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:48:42,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:48:42,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:48:48,513 INFO L124 PetriNetUnfolderBase]: 26211/35883 cut-off events. [2023-08-24 08:48:48,513 INFO L125 PetriNetUnfolderBase]: For 888802/890876 co-relation queries the response was YES. [2023-08-24 08:48:48,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292174 conditions, 35883 events. 26211/35883 cut-off events. For 888802/890876 co-relation queries the response was YES. Maximal size of possible extension queue 1887. Compared 215436 event pairs, 5369 based on Foata normal form. 2035/37465 useless extension candidates. Maximal degree in co-relation 276003. Up to 20080 conditions per place. [2023-08-24 08:48:48,909 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 268 selfloop transitions, 326 changer transitions 38/660 dead transitions. [2023-08-24 08:48:48,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 660 transitions, 14032 flow [2023-08-24 08:48:48,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:48:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:48:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-24 08:48:48,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-08-24 08:48:48,910 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-24 08:48:48,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-24 08:48:48,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:48:48,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-24 08:48:48,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:48,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:48,912 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:48,912 INFO L175 Difference]: Start difference. First operand has 180 places, 538 transitions, 10813 flow. Second operand 5 states and 507 transitions. [2023-08-24 08:48:48,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 660 transitions, 14032 flow [2023-08-24 08:48:57,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 660 transitions, 13878 flow, removed 31 selfloop flow, removed 1 redundant places. [2023-08-24 08:48:57,497 INFO L231 Difference]: Finished difference. Result has 183 places, 543 transitions, 11498 flow [2023-08-24 08:48:57,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=10691, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=317, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11498, PETRI_PLACES=183, PETRI_TRANSITIONS=543} [2023-08-24 08:48:57,497 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2023-08-24 08:48:57,498 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 543 transitions, 11498 flow [2023-08-24 08:48:57,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:57,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:48:57,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:48:57,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-24 08:48:57,498 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:48:57,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:48:57,498 INFO L85 PathProgramCache]: Analyzing trace with hash 772963800, now seen corresponding path program 7 times [2023-08-24 08:48:57,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:48:57,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541280707] [2023-08-24 08:48:57,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:48:57,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:48:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:48:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:48:57,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:48:57,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541280707] [2023-08-24 08:48:57,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541280707] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:48:57,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:48:57,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:48:57,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997912500] [2023-08-24 08:48:57,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:48:57,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:48:57,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:48:57,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:48:57,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:48:57,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:48:57,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 543 transitions, 11498 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:48:57,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:48:57,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:48:57,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:49:03,345 INFO L124 PetriNetUnfolderBase]: 27084/36936 cut-off events. [2023-08-24 08:49:03,345 INFO L125 PetriNetUnfolderBase]: For 959673/962838 co-relation queries the response was YES. [2023-08-24 08:49:03,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297130 conditions, 36936 events. 27084/36936 cut-off events. For 959673/962838 co-relation queries the response was YES. Maximal size of possible extension queue 1882. Compared 219138 event pairs, 5170 based on Foata normal form. 1869/38419 useless extension candidates. Maximal degree in co-relation 276752. Up to 17917 conditions per place. [2023-08-24 08:49:03,937 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 783 selfloop transitions, 92 changer transitions 60/972 dead transitions. [2023-08-24 08:49:03,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 972 transitions, 22422 flow [2023-08-24 08:49:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:49:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:49:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-08-24 08:49:03,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838095238095238 [2023-08-24 08:49:03,939 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-08-24 08:49:03,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-08-24 08:49:03,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:49:03,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-08-24 08:49:03,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:03,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:03,940 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:03,940 INFO L175 Difference]: Start difference. First operand has 183 places, 543 transitions, 11498 flow. Second operand 5 states and 508 transitions. [2023-08-24 08:49:03,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 972 transitions, 22422 flow [2023-08-24 08:49:12,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 972 transitions, 21168 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-24 08:49:12,122 INFO L231 Difference]: Finished difference. Result has 186 places, 541 transitions, 11030 flow [2023-08-24 08:49:12,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=10832, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11030, PETRI_PLACES=186, PETRI_TRANSITIONS=541} [2023-08-24 08:49:12,122 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 148 predicate places. [2023-08-24 08:49:12,123 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 541 transitions, 11030 flow [2023-08-24 08:49:12,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:12,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:49:12,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:49:12,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-24 08:49:12,123 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:49:12,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:49:12,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1690867288, now seen corresponding path program 8 times [2023-08-24 08:49:12,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:49:12,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215481580] [2023-08-24 08:49:12,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:49:12,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:49:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:49:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:49:12,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:49:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215481580] [2023-08-24 08:49:12,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215481580] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:49:12,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:49:12,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:49:12,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081557278] [2023-08-24 08:49:12,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:49:12,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:49:12,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:49:12,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:49:12,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:49:12,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:49:12,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 541 transitions, 11030 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:12,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:49:12,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:49:12,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:49:18,433 INFO L124 PetriNetUnfolderBase]: 29598/40090 cut-off events. [2023-08-24 08:49:18,433 INFO L125 PetriNetUnfolderBase]: For 1138498/1142646 co-relation queries the response was YES. [2023-08-24 08:49:18,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330361 conditions, 40090 events. 29598/40090 cut-off events. For 1138498/1142646 co-relation queries the response was YES. Maximal size of possible extension queue 2175. Compared 236669 event pairs, 7291 based on Foata normal form. 3612/43125 useless extension candidates. Maximal degree in co-relation 310457. Up to 28921 conditions per place. [2023-08-24 08:49:18,793 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 528 selfloop transitions, 161 changer transitions 36/759 dead transitions. [2023-08-24 08:49:18,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 759 transitions, 16289 flow [2023-08-24 08:49:18,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:49:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:49:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-24 08:49:18,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847619047619048 [2023-08-24 08:49:18,795 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-24 08:49:18,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-24 08:49:18,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:49:18,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-24 08:49:18,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:18,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:18,796 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:18,796 INFO L175 Difference]: Start difference. First operand has 186 places, 541 transitions, 11030 flow. Second operand 5 states and 509 transitions. [2023-08-24 08:49:18,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 759 transitions, 16289 flow [2023-08-24 08:49:27,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 759 transitions, 15986 flow, removed 73 selfloop flow, removed 3 redundant places. [2023-08-24 08:49:27,340 INFO L231 Difference]: Finished difference. Result has 189 places, 628 transitions, 13125 flow [2023-08-24 08:49:27,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=10818, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13125, PETRI_PLACES=189, PETRI_TRANSITIONS=628} [2023-08-24 08:49:27,341 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 151 predicate places. [2023-08-24 08:49:27,341 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 628 transitions, 13125 flow [2023-08-24 08:49:27,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:27,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:49:27,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:49:27,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-24 08:49:27,341 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:49:27,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:49:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1339221760, now seen corresponding path program 9 times [2023-08-24 08:49:27,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:49:27,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087742084] [2023-08-24 08:49:27,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:49:27,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:49:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:49:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:49:27,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:49:27,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087742084] [2023-08-24 08:49:27,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087742084] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:49:27,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:49:27,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:49:27,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913006439] [2023-08-24 08:49:27,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:49:27,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:49:27,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:49:27,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:49:27,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:49:27,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:49:27,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 628 transitions, 13125 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:27,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:49:27,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:49:27,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:49:34,079 INFO L124 PetriNetUnfolderBase]: 28486/38902 cut-off events. [2023-08-24 08:49:34,080 INFO L125 PetriNetUnfolderBase]: For 1112615/1116377 co-relation queries the response was YES. [2023-08-24 08:49:34,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332927 conditions, 38902 events. 28486/38902 cut-off events. For 1112615/1116377 co-relation queries the response was YES. Maximal size of possible extension queue 2084. Compared 233664 event pairs, 6274 based on Foata normal form. 2657/40805 useless extension candidates. Maximal degree in co-relation 316710. Up to 22037 conditions per place. [2023-08-24 08:49:34,652 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 393 selfloop transitions, 326 changer transitions 37/785 dead transitions. [2023-08-24 08:49:34,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 785 transitions, 17580 flow [2023-08-24 08:49:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:49:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:49:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-24 08:49:34,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-08-24 08:49:34,653 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-24 08:49:34,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-24 08:49:34,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:49:34,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-24 08:49:34,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:34,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:34,655 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:34,655 INFO L175 Difference]: Start difference. First operand has 189 places, 628 transitions, 13125 flow. Second operand 5 states and 507 transitions. [2023-08-24 08:49:34,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 785 transitions, 17580 flow [2023-08-24 08:49:43,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 785 transitions, 17269 flow, removed 80 selfloop flow, removed 1 redundant places. [2023-08-24 08:49:43,895 INFO L231 Difference]: Finished difference. Result has 193 places, 634 transitions, 13766 flow [2023-08-24 08:49:43,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=12892, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=316, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13766, PETRI_PLACES=193, PETRI_TRANSITIONS=634} [2023-08-24 08:49:43,896 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 155 predicate places. [2023-08-24 08:49:43,896 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 634 transitions, 13766 flow [2023-08-24 08:49:43,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:43,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:49:43,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:49:43,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-24 08:49:43,896 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:49:43,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:49:43,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1864656116, now seen corresponding path program 10 times [2023-08-24 08:49:43,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:49:43,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455352714] [2023-08-24 08:49:43,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:49:43,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:49:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:49:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:49:43,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:49:43,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455352714] [2023-08-24 08:49:43,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455352714] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:49:43,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:49:43,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:49:43,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951705621] [2023-08-24 08:49:43,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:49:43,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:49:43,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:49:43,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:49:43,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:49:43,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:49:43,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 634 transitions, 13766 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:43,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:49:43,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:49:43,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:49:50,888 INFO L124 PetriNetUnfolderBase]: 30870/41853 cut-off events. [2023-08-24 08:49:50,888 INFO L125 PetriNetUnfolderBase]: For 1271678/1276350 co-relation queries the response was YES. [2023-08-24 08:49:51,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356416 conditions, 41853 events. 30870/41853 cut-off events. For 1271678/1276350 co-relation queries the response was YES. Maximal size of possible extension queue 2305. Compared 250046 event pairs, 7560 based on Foata normal form. 4003/45246 useless extension candidates. Maximal degree in co-relation 334771. Up to 30161 conditions per place. [2023-08-24 08:49:51,548 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 568 selfloop transitions, 180 changer transitions 12/794 dead transitions. [2023-08-24 08:49:51,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 794 transitions, 18153 flow [2023-08-24 08:49:51,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:49:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:49:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-24 08:49:51,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847619047619048 [2023-08-24 08:49:51,550 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-24 08:49:51,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-24 08:49:51,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:49:51,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-24 08:49:51,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:51,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:51,566 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:49:51,566 INFO L175 Difference]: Start difference. First operand has 193 places, 634 transitions, 13766 flow. Second operand 5 states and 509 transitions. [2023-08-24 08:49:51,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 794 transitions, 18153 flow [2023-08-24 08:50:02,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 794 transitions, 17382 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-08-24 08:50:02,406 INFO L231 Difference]: Finished difference. Result has 194 places, 655 transitions, 13786 flow [2023-08-24 08:50:02,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=13090, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13786, PETRI_PLACES=194, PETRI_TRANSITIONS=655} [2023-08-24 08:50:02,407 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 156 predicate places. [2023-08-24 08:50:02,407 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 655 transitions, 13786 flow [2023-08-24 08:50:02,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:02,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:50:02,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:50:02,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-24 08:50:02,408 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:50:02,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:50:02,408 INFO L85 PathProgramCache]: Analyzing trace with hash -584387732, now seen corresponding path program 11 times [2023-08-24 08:50:02,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:50:02,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073013193] [2023-08-24 08:50:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:50:02,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:50:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:50:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:50:02,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:50:02,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073013193] [2023-08-24 08:50:02,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073013193] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:50:02,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:50:02,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:50:02,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787562744] [2023-08-24 08:50:02,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:50:02,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:50:02,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:50:02,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:50:02,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:50:02,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:50:02,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 655 transitions, 13786 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:02,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:50:02,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:50:02,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:50:09,813 INFO L124 PetriNetUnfolderBase]: 30662/41940 cut-off events. [2023-08-24 08:50:09,813 INFO L125 PetriNetUnfolderBase]: For 1300680/1306613 co-relation queries the response was YES. [2023-08-24 08:50:10,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359871 conditions, 41940 events. 30662/41940 cut-off events. For 1300680/1306613 co-relation queries the response was YES. Maximal size of possible extension queue 2381. Compared 257082 event pairs, 7290 based on Foata normal form. 4111/45096 useless extension candidates. Maximal degree in co-relation 339398. Up to 28898 conditions per place. [2023-08-24 08:50:10,302 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 533 selfloop transitions, 176 changer transitions 35/782 dead transitions. [2023-08-24 08:50:10,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 782 transitions, 17528 flow [2023-08-24 08:50:10,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:50:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:50:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-24 08:50:10,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-08-24 08:50:10,303 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-24 08:50:10,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-24 08:50:10,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:50:10,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-24 08:50:10,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:10,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:10,305 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:10,305 INFO L175 Difference]: Start difference. First operand has 194 places, 655 transitions, 13786 flow. Second operand 5 states and 507 transitions. [2023-08-24 08:50:10,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 782 transitions, 17528 flow [2023-08-24 08:50:22,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 782 transitions, 17215 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-08-24 08:50:22,018 INFO L231 Difference]: Finished difference. Result has 197 places, 657 transitions, 14006 flow [2023-08-24 08:50:22,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=13484, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14006, PETRI_PLACES=197, PETRI_TRANSITIONS=657} [2023-08-24 08:50:22,019 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 159 predicate places. [2023-08-24 08:50:22,019 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 657 transitions, 14006 flow [2023-08-24 08:50:22,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:22,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:50:22,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:50:22,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-08-24 08:50:22,019 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:50:22,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:50:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash 805344777, now seen corresponding path program 8 times [2023-08-24 08:50:22,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:50:22,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731556910] [2023-08-24 08:50:22,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:50:22,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:50:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:50:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:50:22,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:50:22,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731556910] [2023-08-24 08:50:22,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731556910] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:50:22,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:50:22,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:50:22,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996943261] [2023-08-24 08:50:22,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:50:22,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:50:22,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:50:22,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:50:22,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:50:22,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:50:22,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 657 transitions, 14006 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:22,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:50:22,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:50:22,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:50:29,287 INFO L124 PetriNetUnfolderBase]: 28910/39497 cut-off events. [2023-08-24 08:50:29,287 INFO L125 PetriNetUnfolderBase]: For 1201824/1206740 co-relation queries the response was YES. [2023-08-24 08:50:29,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337906 conditions, 39497 events. 28910/39497 cut-off events. For 1201824/1206740 co-relation queries the response was YES. Maximal size of possible extension queue 2237. Compared 240308 event pairs, 6493 based on Foata normal form. 3443/42062 useless extension candidates. Maximal degree in co-relation 319980. Up to 21612 conditions per place. [2023-08-24 08:50:29,736 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 351 selfloop transitions, 326 changer transitions 61/770 dead transitions. [2023-08-24 08:50:29,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 770 transitions, 17542 flow [2023-08-24 08:50:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:50:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:50:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-08-24 08:50:29,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47904761904761906 [2023-08-24 08:50:29,737 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-08-24 08:50:29,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-08-24 08:50:29,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:50:29,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-08-24 08:50:29,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:29,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:29,739 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:29,742 INFO L175 Difference]: Start difference. First operand has 197 places, 657 transitions, 14006 flow. Second operand 5 states and 503 transitions. [2023-08-24 08:50:29,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 770 transitions, 17542 flow [2023-08-24 08:50:40,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 770 transitions, 17113 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-08-24 08:50:40,901 INFO L231 Difference]: Finished difference. Result has 199 places, 624 transitions, 13634 flow [2023-08-24 08:50:40,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=13572, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=320, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13634, PETRI_PLACES=199, PETRI_TRANSITIONS=624} [2023-08-24 08:50:40,902 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 161 predicate places. [2023-08-24 08:50:40,902 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 624 transitions, 13634 flow [2023-08-24 08:50:40,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:40,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:50:40,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:50:40,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-08-24 08:50:40,902 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:50:40,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:50:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash 46312919, now seen corresponding path program 9 times [2023-08-24 08:50:40,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:50:40,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945674539] [2023-08-24 08:50:40,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:50:40,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:50:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:50:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:50:40,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:50:40,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945674539] [2023-08-24 08:50:40,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945674539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:50:40,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:50:40,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:50:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468609585] [2023-08-24 08:50:40,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:50:40,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:50:40,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:50:40,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:50:40,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:50:40,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:50:40,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 624 transitions, 13634 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:40,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:50:40,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:50:40,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:50:47,804 INFO L124 PetriNetUnfolderBase]: 29255/40219 cut-off events. [2023-08-24 08:50:47,804 INFO L125 PetriNetUnfolderBase]: For 1152831/1155234 co-relation queries the response was YES. [2023-08-24 08:50:48,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334955 conditions, 40219 events. 29255/40219 cut-off events. For 1152831/1155234 co-relation queries the response was YES. Maximal size of possible extension queue 2123. Compared 244453 event pairs, 7357 based on Foata normal form. 1908/41729 useless extension candidates. Maximal degree in co-relation 315540. Up to 29043 conditions per place. [2023-08-24 08:50:48,200 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 623 selfloop transitions, 148 changer transitions 75/883 dead transitions. [2023-08-24 08:50:48,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 883 transitions, 20313 flow [2023-08-24 08:50:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:50:48,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:50:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-24 08:50:48,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-08-24 08:50:48,201 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-24 08:50:48,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-24 08:50:48,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:50:48,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-24 08:50:48,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:48,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:48,203 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:48,203 INFO L175 Difference]: Start difference. First operand has 199 places, 624 transitions, 13634 flow. Second operand 5 states and 507 transitions. [2023-08-24 08:50:48,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 883 transitions, 20313 flow [2023-08-24 08:50:59,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 883 transitions, 19419 flow, removed 118 selfloop flow, removed 3 redundant places. [2023-08-24 08:50:59,600 INFO L231 Difference]: Finished difference. Result has 202 places, 678 transitions, 14673 flow [2023-08-24 08:50:59,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=12939, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14673, PETRI_PLACES=202, PETRI_TRANSITIONS=678} [2023-08-24 08:50:59,600 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 164 predicate places. [2023-08-24 08:50:59,601 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 678 transitions, 14673 flow [2023-08-24 08:50:59,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:59,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:50:59,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:50:59,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-08-24 08:50:59,601 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:50:59,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:50:59,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1721037319, now seen corresponding path program 10 times [2023-08-24 08:50:59,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:50:59,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749402072] [2023-08-24 08:50:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:50:59,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:50:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:50:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:50:59,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:50:59,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749402072] [2023-08-24 08:50:59,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749402072] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:50:59,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:50:59,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:50:59,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956055926] [2023-08-24 08:50:59,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:50:59,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:50:59,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:50:59,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:50:59,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:50:59,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:50:59,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 678 transitions, 14673 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:50:59,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:50:59,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:50:59,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:51:06,911 INFO L124 PetriNetUnfolderBase]: 29844/40905 cut-off events. [2023-08-24 08:51:06,911 INFO L125 PetriNetUnfolderBase]: For 1202737/1205193 co-relation queries the response was YES. [2023-08-24 08:51:07,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343233 conditions, 40905 events. 29844/40905 cut-off events. For 1202737/1205193 co-relation queries the response was YES. Maximal size of possible extension queue 2171. Compared 247357 event pairs, 7554 based on Foata normal form. 2191/42738 useless extension candidates. Maximal degree in co-relation 324515. Up to 29571 conditions per place. [2023-08-24 08:51:07,383 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 662 selfloop transitions, 150 changer transitions 22/871 dead transitions. [2023-08-24 08:51:07,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 871 transitions, 19795 flow [2023-08-24 08:51:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:51:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:51:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2023-08-24 08:51:07,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2023-08-24 08:51:07,385 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2023-08-24 08:51:07,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2023-08-24 08:51:07,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:51:07,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2023-08-24 08:51:07,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:51:07,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:51:07,387 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:51:07,387 INFO L175 Difference]: Start difference. First operand has 202 places, 678 transitions, 14673 flow. Second operand 5 states and 505 transitions. [2023-08-24 08:51:07,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 871 transitions, 19795 flow [2023-08-24 08:51:20,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 871 transitions, 19509 flow, removed 143 selfloop flow, removed 0 redundant places. [2023-08-24 08:51:20,699 INFO L231 Difference]: Finished difference. Result has 206 places, 686 transitions, 14877 flow [2023-08-24 08:51:20,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=14387, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14877, PETRI_PLACES=206, PETRI_TRANSITIONS=686} [2023-08-24 08:51:20,700 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 168 predicate places. [2023-08-24 08:51:20,700 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 686 transitions, 14877 flow [2023-08-24 08:51:20,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:51:20,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:51:20,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:51:20,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-08-24 08:51:20,700 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:51:20,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:51:20,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1716797783, now seen corresponding path program 11 times [2023-08-24 08:51:20,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:51:20,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388704471] [2023-08-24 08:51:20,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:51:20,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:51:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:51:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:51:20,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:51:20,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388704471] [2023-08-24 08:51:20,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388704471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:51:20,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:51:20,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:51:20,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571907165] [2023-08-24 08:51:20,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:51:20,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:51:20,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:51:20,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:51:20,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:51:20,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:51:20,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 686 transitions, 14877 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:51:20,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:51:20,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:51:20,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:51:28,357 INFO L124 PetriNetUnfolderBase]: 30929/42372 cut-off events. [2023-08-24 08:51:28,357 INFO L125 PetriNetUnfolderBase]: For 1245602/1248523 co-relation queries the response was YES. [2023-08-24 08:51:28,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354221 conditions, 42372 events. 30929/42372 cut-off events. For 1245602/1248523 co-relation queries the response was YES. Maximal size of possible extension queue 2309. Compared 258367 event pairs, 4624 based on Foata normal form. 2526/44514 useless extension candidates. Maximal degree in co-relation 332097. Up to 18090 conditions per place. [2023-08-24 08:51:28,780 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 892 selfloop transitions, 118 changer transitions 91/1137 dead transitions. [2023-08-24 08:51:28,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 1137 transitions, 26457 flow [2023-08-24 08:51:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:51:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:51:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-08-24 08:51:28,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-08-24 08:51:28,781 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-08-24 08:51:28,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-08-24 08:51:28,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:51:28,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-08-24 08:51:28,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:51:28,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:51:28,783 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:51:28,783 INFO L175 Difference]: Start difference. First operand has 206 places, 686 transitions, 14877 flow. Second operand 5 states and 510 transitions. [2023-08-24 08:51:28,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 1137 transitions, 26457 flow [2023-08-24 08:51:42,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 1137 transitions, 26023 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-08-24 08:51:42,832 INFO L231 Difference]: Finished difference. Result has 209 places, 685 transitions, 14840 flow [2023-08-24 08:51:42,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=14521, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14840, PETRI_PLACES=209, PETRI_TRANSITIONS=685} [2023-08-24 08:51:42,832 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 171 predicate places. [2023-08-24 08:51:42,832 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 685 transitions, 14840 flow [2023-08-24 08:51:42,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:51:42,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:51:42,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:51:42,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-08-24 08:51:42,833 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:51:42,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:51:42,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1743080696, now seen corresponding path program 12 times [2023-08-24 08:51:42,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:51:42,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987217115] [2023-08-24 08:51:42,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:51:42,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:51:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:51:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:51:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:51:42,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987217115] [2023-08-24 08:51:42,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987217115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:51:42,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:51:42,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:51:42,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209383905] [2023-08-24 08:51:42,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:51:42,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:51:42,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:51:42,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:51:42,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:51:42,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:51:42,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 685 transitions, 14840 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:51:42,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:51:42,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:51:42,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:51:50,826 INFO L124 PetriNetUnfolderBase]: 30223/41612 cut-off events. [2023-08-24 08:51:50,826 INFO L125 PetriNetUnfolderBase]: For 1247495/1249978 co-relation queries the response was YES. [2023-08-24 08:51:51,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349058 conditions, 41612 events. 30223/41612 cut-off events. For 1247495/1249978 co-relation queries the response was YES. Maximal size of possible extension queue 2271. Compared 256045 event pairs, 6545 based on Foata normal form. 1894/42875 useless extension candidates. Maximal degree in co-relation 329727. Up to 21815 conditions per place. [2023-08-24 08:51:51,532 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 417 selfloop transitions, 323 changer transitions 35/813 dead transitions. [2023-08-24 08:51:51,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 813 transitions, 18590 flow [2023-08-24 08:51:51,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:51:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:51:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2023-08-24 08:51:51,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4866666666666667 [2023-08-24 08:51:51,533 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2023-08-24 08:51:51,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2023-08-24 08:51:51,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:51:51,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2023-08-24 08:51:51,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:51:51,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:51:51,534 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:51:51,534 INFO L175 Difference]: Start difference. First operand has 209 places, 685 transitions, 14840 flow. Second operand 5 states and 511 transitions. [2023-08-24 08:51:51,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 813 transitions, 18590 flow [2023-08-24 08:52:05,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 813 transitions, 18270 flow, removed 47 selfloop flow, removed 2 redundant places. [2023-08-24 08:52:05,336 INFO L231 Difference]: Finished difference. Result has 212 places, 673 transitions, 15107 flow [2023-08-24 08:52:05,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=14484, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15107, PETRI_PLACES=212, PETRI_TRANSITIONS=673} [2023-08-24 08:52:05,337 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 174 predicate places. [2023-08-24 08:52:05,337 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 673 transitions, 15107 flow [2023-08-24 08:52:05,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:05,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:52:05,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:52:05,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-08-24 08:52:05,337 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:52:05,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:52:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1475494379, now seen corresponding path program 12 times [2023-08-24 08:52:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:52:05,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299478920] [2023-08-24 08:52:05,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:52:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:52:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:52:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:52:05,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:52:05,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299478920] [2023-08-24 08:52:05,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299478920] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:52:05,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:52:05,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:52:05,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647593896] [2023-08-24 08:52:05,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:52:05,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:52:05,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:52:05,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:52:05,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:52:05,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:52:05,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 673 transitions, 15107 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:05,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:52:05,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:52:05,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:52:12,498 INFO L124 PetriNetUnfolderBase]: 28243/38475 cut-off events. [2023-08-24 08:52:12,499 INFO L125 PetriNetUnfolderBase]: For 1182278/1185841 co-relation queries the response was YES. [2023-08-24 08:52:12,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327580 conditions, 38475 events. 28243/38475 cut-off events. For 1182278/1185841 co-relation queries the response was YES. Maximal size of possible extension queue 2147. Compared 230087 event pairs, 6588 based on Foata normal form. 2652/40765 useless extension candidates. Maximal degree in co-relation 304679. Up to 26279 conditions per place. [2023-08-24 08:52:12,955 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 667 selfloop transitions, 147 changer transitions 127/977 dead transitions. [2023-08-24 08:52:12,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 977 transitions, 23652 flow [2023-08-24 08:52:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:52:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:52:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-08-24 08:52:12,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47714285714285715 [2023-08-24 08:52:12,957 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-08-24 08:52:12,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-08-24 08:52:12,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:52:12,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-08-24 08:52:12,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:12,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:12,958 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:12,958 INFO L175 Difference]: Start difference. First operand has 212 places, 673 transitions, 15107 flow. Second operand 5 states and 501 transitions. [2023-08-24 08:52:12,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 977 transitions, 23652 flow [2023-08-24 08:52:25,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 977 transitions, 22619 flow, removed 65 selfloop flow, removed 4 redundant places. [2023-08-24 08:52:25,519 INFO L231 Difference]: Finished difference. Result has 212 places, 615 transitions, 13294 flow [2023-08-24 08:52:25,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=14435, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13294, PETRI_PLACES=212, PETRI_TRANSITIONS=615} [2023-08-24 08:52:25,521 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 174 predicate places. [2023-08-24 08:52:25,521 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 615 transitions, 13294 flow [2023-08-24 08:52:25,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:25,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:52:25,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:52:25,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-08-24 08:52:25,521 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:52:25,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:52:25,522 INFO L85 PathProgramCache]: Analyzing trace with hash -75479744, now seen corresponding path program 13 times [2023-08-24 08:52:25,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:52:25,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573674510] [2023-08-24 08:52:25,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:52:25,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:52:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:52:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:52:25,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:52:25,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573674510] [2023-08-24 08:52:25,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573674510] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:52:25,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:52:25,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:52:25,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908029233] [2023-08-24 08:52:25,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:52:25,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:52:25,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:52:25,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:52:25,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:52:25,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:52:25,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 615 transitions, 13294 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:25,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:52:25,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:52:25,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:52:30,943 INFO L124 PetriNetUnfolderBase]: 23183/31316 cut-off events. [2023-08-24 08:52:30,943 INFO L125 PetriNetUnfolderBase]: For 884506/886496 co-relation queries the response was YES. [2023-08-24 08:52:31,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258616 conditions, 31316 events. 23183/31316 cut-off events. For 884506/886496 co-relation queries the response was YES. Maximal size of possible extension queue 1630. Compared 177639 event pairs, 5263 based on Foata normal form. 1662/32443 useless extension candidates. Maximal degree in co-relation 239433. Up to 21276 conditions per place. [2023-08-24 08:52:31,242 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 538 selfloop transitions, 253 changer transitions 38/859 dead transitions. [2023-08-24 08:52:31,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 859 transitions, 19589 flow [2023-08-24 08:52:31,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:52:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:52:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-24 08:52:31,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-08-24 08:52:31,244 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-24 08:52:31,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-24 08:52:31,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:52:31,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-24 08:52:31,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:31,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:31,245 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:31,246 INFO L175 Difference]: Start difference. First operand has 212 places, 615 transitions, 13294 flow. Second operand 5 states and 507 transitions. [2023-08-24 08:52:31,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 859 transitions, 19589 flow [2023-08-24 08:52:39,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 859 transitions, 18359 flow, removed 308 selfloop flow, removed 12 redundant places. [2023-08-24 08:52:39,582 INFO L231 Difference]: Finished difference. Result has 197 places, 758 transitions, 16775 flow [2023-08-24 08:52:39,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=12274, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=16775, PETRI_PLACES=197, PETRI_TRANSITIONS=758} [2023-08-24 08:52:39,583 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 159 predicate places. [2023-08-24 08:52:39,583 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 758 transitions, 16775 flow [2023-08-24 08:52:39,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:39,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:52:39,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:52:39,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-08-24 08:52:39,583 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:52:39,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:52:39,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1944599926, now seen corresponding path program 14 times [2023-08-24 08:52:39,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:52:39,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880134104] [2023-08-24 08:52:39,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:52:39,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:52:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:52:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:52:39,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:52:39,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880134104] [2023-08-24 08:52:39,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880134104] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:52:39,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:52:39,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:52:39,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354707983] [2023-08-24 08:52:39,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:52:39,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:52:39,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:52:39,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:52:39,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:52:39,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:52:39,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 758 transitions, 16775 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:39,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:52:39,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:52:39,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:52:45,385 INFO L124 PetriNetUnfolderBase]: 24018/32301 cut-off events. [2023-08-24 08:52:45,385 INFO L125 PetriNetUnfolderBase]: For 801684/803974 co-relation queries the response was YES. [2023-08-24 08:52:45,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262927 conditions, 32301 events. 24018/32301 cut-off events. For 801684/803974 co-relation queries the response was YES. Maximal size of possible extension queue 1741. Compared 182848 event pairs, 2770 based on Foata normal form. 1920/33496 useless extension candidates. Maximal degree in co-relation 239045. Up to 16688 conditions per place. [2023-08-24 08:52:45,729 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 431 selfloop transitions, 403 changer transitions 41/905 dead transitions. [2023-08-24 08:52:45,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 905 transitions, 21085 flow [2023-08-24 08:52:45,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:52:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:52:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2023-08-24 08:52:45,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895238095238095 [2023-08-24 08:52:45,730 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 514 transitions. [2023-08-24 08:52:45,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 514 transitions. [2023-08-24 08:52:45,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:52:45,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 514 transitions. [2023-08-24 08:52:45,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:45,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:45,731 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:45,731 INFO L175 Difference]: Start difference. First operand has 197 places, 758 transitions, 16775 flow. Second operand 5 states and 514 transitions. [2023-08-24 08:52:45,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 905 transitions, 21085 flow [2023-08-24 08:52:54,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 905 transitions, 20803 flow, removed 141 selfloop flow, removed 0 redundant places. [2023-08-24 08:52:54,180 INFO L231 Difference]: Finished difference. Result has 203 places, 766 transitions, 17894 flow [2023-08-24 08:52:54,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=16511, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=387, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=17894, PETRI_PLACES=203, PETRI_TRANSITIONS=766} [2023-08-24 08:52:54,181 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 165 predicate places. [2023-08-24 08:52:54,181 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 766 transitions, 17894 flow [2023-08-24 08:52:54,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:54,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:52:54,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:52:54,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-08-24 08:52:54,181 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:52:54,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:52:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2022182510, now seen corresponding path program 11 times [2023-08-24 08:52:54,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:52:54,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977214673] [2023-08-24 08:52:54,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:52:54,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:52:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:52:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:52:54,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:52:54,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977214673] [2023-08-24 08:52:54,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977214673] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:52:54,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:52:54,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:52:54,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282465241] [2023-08-24 08:52:54,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:52:54,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:52:54,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:52:54,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:52:54,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:52:54,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:52:54,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 766 transitions, 17894 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:52:54,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:52:54,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:52:54,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:53:00,339 INFO L124 PetriNetUnfolderBase]: 24920/33305 cut-off events. [2023-08-24 08:53:00,339 INFO L125 PetriNetUnfolderBase]: For 879305/882422 co-relation queries the response was YES. [2023-08-24 08:53:00,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270458 conditions, 33305 events. 24920/33305 cut-off events. For 879305/882422 co-relation queries the response was YES. Maximal size of possible extension queue 1773. Compared 185649 event pairs, 5454 based on Foata normal form. 2224/35030 useless extension candidates. Maximal degree in co-relation 252749. Up to 23336 conditions per place. [2023-08-24 08:53:00,727 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 676 selfloop transitions, 174 changer transitions 19/917 dead transitions. [2023-08-24 08:53:00,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 917 transitions, 22155 flow [2023-08-24 08:53:00,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:53:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:53:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-08-24 08:53:00,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838095238095238 [2023-08-24 08:53:00,728 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-08-24 08:53:00,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-08-24 08:53:00,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:53:00,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-08-24 08:53:00,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:00,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:00,729 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:00,729 INFO L175 Difference]: Start difference. First operand has 203 places, 766 transitions, 17894 flow. Second operand 5 states and 508 transitions. [2023-08-24 08:53:00,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 917 transitions, 22155 flow [2023-08-24 08:53:09,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 917 transitions, 21620 flow, removed 46 selfloop flow, removed 3 redundant places. [2023-08-24 08:53:09,991 INFO L231 Difference]: Finished difference. Result has 205 places, 842 transitions, 19480 flow [2023-08-24 08:53:09,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=17397, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=19480, PETRI_PLACES=205, PETRI_TRANSITIONS=842} [2023-08-24 08:53:09,991 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 167 predicate places. [2023-08-24 08:53:09,991 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 842 transitions, 19480 flow [2023-08-24 08:53:09,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:09,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:53:09,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:53:09,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-08-24 08:53:09,992 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:53:09,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:53:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash -464180808, now seen corresponding path program 15 times [2023-08-24 08:53:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:53:09,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832647472] [2023-08-24 08:53:09,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:53:09,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:53:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:53:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:53:10,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:53:10,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832647472] [2023-08-24 08:53:10,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832647472] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:53:10,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:53:10,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:53:10,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602861113] [2023-08-24 08:53:10,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:53:10,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:53:10,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:53:10,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:53:10,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:53:10,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:53:10,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 842 transitions, 19480 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:10,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:53:10,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:53:10,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:53:16,065 INFO L124 PetriNetUnfolderBase]: 22996/30754 cut-off events. [2023-08-24 08:53:16,066 INFO L125 PetriNetUnfolderBase]: For 808980/811848 co-relation queries the response was YES. [2023-08-24 08:53:16,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256204 conditions, 30754 events. 22996/30754 cut-off events. For 808980/811848 co-relation queries the response was YES. Maximal size of possible extension queue 1674. Compared 171052 event pairs, 4586 based on Foata normal form. 2313/32268 useless extension candidates. Maximal degree in co-relation 239627. Up to 16371 conditions per place. [2023-08-24 08:53:16,380 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 452 selfloop transitions, 428 changer transitions 36/955 dead transitions. [2023-08-24 08:53:16,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 955 transitions, 23187 flow [2023-08-24 08:53:16,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:53:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:53:16,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-24 08:53:16,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-08-24 08:53:16,381 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-24 08:53:16,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-24 08:53:16,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:53:16,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-24 08:53:16,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:16,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:16,382 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:16,382 INFO L175 Difference]: Start difference. First operand has 205 places, 842 transitions, 19480 flow. Second operand 5 states and 507 transitions. [2023-08-24 08:53:16,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 955 transitions, 23187 flow [2023-08-24 08:53:25,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 955 transitions, 22770 flow, removed 140 selfloop flow, removed 1 redundant places. [2023-08-24 08:53:25,276 INFO L231 Difference]: Finished difference. Result has 209 places, 827 transitions, 19620 flow [2023-08-24 08:53:25,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=19076, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=840, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=417, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=19620, PETRI_PLACES=209, PETRI_TRANSITIONS=827} [2023-08-24 08:53:25,283 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 171 predicate places. [2023-08-24 08:53:25,283 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 827 transitions, 19620 flow [2023-08-24 08:53:25,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:25,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:53:25,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:53:25,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-08-24 08:53:25,284 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:53:25,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:53:25,284 INFO L85 PathProgramCache]: Analyzing trace with hash 177565382, now seen corresponding path program 12 times [2023-08-24 08:53:25,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:53:25,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15210174] [2023-08-24 08:53:25,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:53:25,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:53:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:53:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:53:25,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:53:25,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15210174] [2023-08-24 08:53:25,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15210174] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:53:25,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:53:25,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:53:25,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294764487] [2023-08-24 08:53:25,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:53:25,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:53:25,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:53:25,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:53:25,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:53:25,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:53:25,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 827 transitions, 19620 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:25,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:53:25,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:53:25,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:53:31,239 INFO L124 PetriNetUnfolderBase]: 23893/31784 cut-off events. [2023-08-24 08:53:31,239 INFO L125 PetriNetUnfolderBase]: For 792157/794185 co-relation queries the response was YES. [2023-08-24 08:53:31,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260340 conditions, 31784 events. 23893/31784 cut-off events. For 792157/794185 co-relation queries the response was YES. Maximal size of possible extension queue 1651. Compared 173214 event pairs, 2536 based on Foata normal form. 1728/33124 useless extension candidates. Maximal degree in co-relation 241023. Up to 17881 conditions per place. [2023-08-24 08:53:31,845 INFO L140 encePairwiseOnDemand]: 205/210 looper letters, 791 selfloop transitions, 162 changer transitions 74/1074 dead transitions. [2023-08-24 08:53:31,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 1074 transitions, 26738 flow [2023-08-24 08:53:31,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:53:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:53:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-24 08:53:31,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847619047619048 [2023-08-24 08:53:31,846 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-24 08:53:31,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-24 08:53:31,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:53:31,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-24 08:53:31,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:31,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:31,848 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:31,848 INFO L175 Difference]: Start difference. First operand has 209 places, 827 transitions, 19620 flow. Second operand 5 states and 509 transitions. [2023-08-24 08:53:31,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 1074 transitions, 26738 flow [2023-08-24 08:53:41,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 1074 transitions, 26036 flow, removed 104 selfloop flow, removed 8 redundant places. [2023-08-24 08:53:41,884 INFO L231 Difference]: Finished difference. Result has 200 places, 851 transitions, 20039 flow [2023-08-24 08:53:41,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=18996, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=827, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=20039, PETRI_PLACES=200, PETRI_TRANSITIONS=851} [2023-08-24 08:53:41,885 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 162 predicate places. [2023-08-24 08:53:41,885 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 851 transitions, 20039 flow [2023-08-24 08:53:41,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:41,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:53:41,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:53:41,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-08-24 08:53:41,885 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:53:41,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:53:41,885 INFO L85 PathProgramCache]: Analyzing trace with hash -346706678, now seen corresponding path program 13 times [2023-08-24 08:53:41,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:53:41,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730675022] [2023-08-24 08:53:41,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:53:41,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:53:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:53:41,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:53:41,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:53:41,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730675022] [2023-08-24 08:53:41,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730675022] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:53:41,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:53:41,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:53:41,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131869861] [2023-08-24 08:53:41,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:53:41,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:53:41,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:53:41,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:53:41,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:53:41,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:53:41,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 851 transitions, 20039 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:41,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:53:41,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:53:41,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:53:48,039 INFO L124 PetriNetUnfolderBase]: 24718/32876 cut-off events. [2023-08-24 08:53:48,039 INFO L125 PetriNetUnfolderBase]: For 831277/832572 co-relation queries the response was YES. [2023-08-24 08:53:48,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265323 conditions, 32876 events. 24718/32876 cut-off events. For 831277/832572 co-relation queries the response was YES. Maximal size of possible extension queue 1650. Compared 178622 event pairs, 2123 based on Foata normal form. 1192/33654 useless extension candidates. Maximal degree in co-relation 245919. Up to 18700 conditions per place. [2023-08-24 08:53:48,352 INFO L140 encePairwiseOnDemand]: 205/210 looper letters, 881 selfloop transitions, 144 changer transitions 49/1134 dead transitions. [2023-08-24 08:53:48,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1134 transitions, 28320 flow [2023-08-24 08:53:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:53:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:53:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2023-08-24 08:53:48,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4866666666666667 [2023-08-24 08:53:48,359 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2023-08-24 08:53:48,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2023-08-24 08:53:48,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:53:48,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2023-08-24 08:53:48,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:48,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:48,365 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:48,365 INFO L175 Difference]: Start difference. First operand has 200 places, 851 transitions, 20039 flow. Second operand 5 states and 511 transitions. [2023-08-24 08:53:48,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1134 transitions, 28320 flow [2023-08-24 08:53:59,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 1134 transitions, 27945 flow, removed 117 selfloop flow, removed 3 redundant places. [2023-08-24 08:53:59,190 INFO L231 Difference]: Finished difference. Result has 202 places, 862 transitions, 20442 flow [2023-08-24 08:53:59,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=19714, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=851, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=20442, PETRI_PLACES=202, PETRI_TRANSITIONS=862} [2023-08-24 08:53:59,190 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 164 predicate places. [2023-08-24 08:53:59,190 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 862 transitions, 20442 flow [2023-08-24 08:53:59,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:59,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:53:59,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:53:59,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-08-24 08:53:59,191 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:53:59,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:53:59,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1847568144, now seen corresponding path program 14 times [2023-08-24 08:53:59,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:53:59,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733116017] [2023-08-24 08:53:59,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:53:59,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:53:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:53:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:53:59,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:53:59,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733116017] [2023-08-24 08:53:59,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733116017] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:53:59,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:53:59,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:53:59,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244649542] [2023-08-24 08:53:59,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:53:59,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 08:53:59,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:53:59,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 08:53:59,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 08:53:59,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:53:59,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 862 transitions, 20442 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:53:59,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:53:59,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:53:59,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:54:05,300 INFO L124 PetriNetUnfolderBase]: 24188/31981 cut-off events. [2023-08-24 08:54:05,301 INFO L125 PetriNetUnfolderBase]: For 867666/869727 co-relation queries the response was YES. [2023-08-24 08:54:05,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262074 conditions, 31981 events. 24188/31981 cut-off events. For 867666/869727 co-relation queries the response was YES. Maximal size of possible extension queue 1623. Compared 171124 event pairs, 5268 based on Foata normal form. 1398/32894 useless extension candidates. Maximal degree in co-relation 244333. Up to 23407 conditions per place. [2023-08-24 08:54:05,612 INFO L140 encePairwiseOnDemand]: 205/210 looper letters, 709 selfloop transitions, 149 changer transitions 29/946 dead transitions. [2023-08-24 08:54:05,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 946 transitions, 23400 flow [2023-08-24 08:54:05,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:54:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:54:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2023-08-24 08:54:05,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-08-24 08:54:05,613 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 500 transitions. [2023-08-24 08:54:05,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 500 transitions. [2023-08-24 08:54:05,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:54:05,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 500 transitions. [2023-08-24 08:54:05,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:05,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:05,614 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:05,614 INFO L175 Difference]: Start difference. First operand has 202 places, 862 transitions, 20442 flow. Second operand 5 states and 500 transitions. [2023-08-24 08:54:05,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 946 transitions, 23400 flow [2023-08-24 08:54:14,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 946 transitions, 23038 flow, removed 48 selfloop flow, removed 6 redundant places. [2023-08-24 08:54:14,937 INFO L231 Difference]: Finished difference. Result has 198 places, 853 transitions, 20153 flow [2023-08-24 08:54:14,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=20033, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=20153, PETRI_PLACES=198, PETRI_TRANSITIONS=853} [2023-08-24 08:54:14,938 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 160 predicate places. [2023-08-24 08:54:14,938 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 853 transitions, 20153 flow [2023-08-24 08:54:14,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:14,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:54:14,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:54:14,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-08-24 08:54:14,938 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:54:14,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:54:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1003015560, now seen corresponding path program 15 times [2023-08-24 08:54:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:54:14,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163651815] [2023-08-24 08:54:14,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:54:14,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:54:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:54:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:54:14,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:54:14,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163651815] [2023-08-24 08:54:14,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163651815] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:54:14,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979198806] [2023-08-24 08:54:14,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 08:54:14,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:54:14,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:54:14,999 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 08:54:15,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 08:54:15,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 08:54:15,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 08:54:15,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 08:54:15,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:54:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:54:15,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:54:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:54:15,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979198806] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:54:15,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:54:15,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-24 08:54:15,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991261650] [2023-08-24 08:54:15,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:54:15,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 08:54:15,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:54:15,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 08:54:15,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-24 08:54:15,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:54:15,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 853 transitions, 20153 flow. Second operand has 10 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:15,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:54:15,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:54:15,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:54:22,115 INFO L124 PetriNetUnfolderBase]: 28029/37071 cut-off events. [2023-08-24 08:54:22,115 INFO L125 PetriNetUnfolderBase]: For 953630/955886 co-relation queries the response was YES. [2023-08-24 08:54:22,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301867 conditions, 37071 events. 28029/37071 cut-off events. For 953630/955886 co-relation queries the response was YES. Maximal size of possible extension queue 1881. Compared 201099 event pairs, 2570 based on Foata normal form. 1944/38703 useless extension candidates. Maximal degree in co-relation 278687. Up to 21710 conditions per place. [2023-08-24 08:54:22,474 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 1250 selfloop transitions, 248 changer transitions 34/1591 dead transitions. [2023-08-24 08:54:22,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 1591 transitions, 38587 flow [2023-08-24 08:54:22,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 08:54:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 08:54:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1001 transitions. [2023-08-24 08:54:22,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766666666666667 [2023-08-24 08:54:22,475 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1001 transitions. [2023-08-24 08:54:22,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1001 transitions. [2023-08-24 08:54:22,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:54:22,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1001 transitions. [2023-08-24 08:54:22,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.1) internal successors, (1001), 10 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:22,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 210.0) internal successors, (2310), 11 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:22,477 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 210.0) internal successors, (2310), 11 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:22,477 INFO L175 Difference]: Start difference. First operand has 198 places, 853 transitions, 20153 flow. Second operand 10 states and 1001 transitions. [2023-08-24 08:54:22,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 1591 transitions, 38587 flow [2023-08-24 08:54:34,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 1591 transitions, 38217 flow, removed 36 selfloop flow, removed 4 redundant places. [2023-08-24 08:54:34,305 INFO L231 Difference]: Finished difference. Result has 205 places, 942 transitions, 22535 flow [2023-08-24 08:54:34,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=19807, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=22535, PETRI_PLACES=205, PETRI_TRANSITIONS=942} [2023-08-24 08:54:34,305 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 167 predicate places. [2023-08-24 08:54:34,305 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 942 transitions, 22535 flow [2023-08-24 08:54:34,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:34,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:54:34,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:54:34,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 08:54:34,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:54:34,510 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:54:34,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:54:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1902619388, now seen corresponding path program 16 times [2023-08-24 08:54:34,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:54:34,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543518786] [2023-08-24 08:54:34,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:54:34,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:54:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:54:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:54:34,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:54:34,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543518786] [2023-08-24 08:54:34,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543518786] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:54:34,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765326936] [2023-08-24 08:54:34,548 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 08:54:34,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:54:34,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:54:34,549 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 08:54:34,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 08:54:34,654 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 08:54:34,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 08:54:34,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 08:54:34,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:54:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:54:34,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:54:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 08:54:34,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765326936] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:54:34,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:54:34,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-24 08:54:34,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101608725] [2023-08-24 08:54:34,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:54:34,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 08:54:34,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:54:34,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 08:54:34,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-24 08:54:34,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:54:34,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 942 transitions, 22535 flow. Second operand has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:34,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:54:34,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:54:34,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:54:41,589 INFO L124 PetriNetUnfolderBase]: 26657/34987 cut-off events. [2023-08-24 08:54:41,589 INFO L125 PetriNetUnfolderBase]: For 1014252/1017187 co-relation queries the response was YES. [2023-08-24 08:54:41,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298593 conditions, 34987 events. 26657/34987 cut-off events. For 1014252/1017187 co-relation queries the response was YES. Maximal size of possible extension queue 1747. Compared 185828 event pairs, 4634 based on Foata normal form. 2129/36724 useless extension candidates. Maximal degree in co-relation 277950. Up to 21226 conditions per place. [2023-08-24 08:54:42,071 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 879 selfloop transitions, 235 changer transitions 38/1211 dead transitions. [2023-08-24 08:54:42,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 1211 transitions, 30568 flow [2023-08-24 08:54:42,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 08:54:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 08:54:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2023-08-24 08:54:42,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793650793650794 [2023-08-24 08:54:42,074 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 604 transitions. [2023-08-24 08:54:42,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions. [2023-08-24 08:54:42,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:54:42,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions. [2023-08-24 08:54:42,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:42,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:42,075 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:42,078 INFO L175 Difference]: Start difference. First operand has 205 places, 942 transitions, 22535 flow. Second operand 6 states and 604 transitions. [2023-08-24 08:54:42,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 1211 transitions, 30568 flow [2023-08-24 08:54:55,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 1211 transitions, 30122 flow, removed 159 selfloop flow, removed 2 redundant places. [2023-08-24 08:54:55,995 INFO L231 Difference]: Finished difference. Result has 208 places, 948 transitions, 22738 flow [2023-08-24 08:54:55,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=22101, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=22738, PETRI_PLACES=208, PETRI_TRANSITIONS=948} [2023-08-24 08:54:55,995 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 170 predicate places. [2023-08-24 08:54:55,995 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 948 transitions, 22738 flow [2023-08-24 08:54:55,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:55,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:54:55,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:54:56,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 08:54:56,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:54:56,200 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:54:56,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:54:56,200 INFO L85 PathProgramCache]: Analyzing trace with hash -865934346, now seen corresponding path program 1 times [2023-08-24 08:54:56,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:54:56,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139254101] [2023-08-24 08:54:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:54:56,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:54:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:54:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 08:54:56,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:54:56,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139254101] [2023-08-24 08:54:56,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139254101] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:54:56,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:54:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 08:54:56,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204782091] [2023-08-24 08:54:56,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:54:56,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 08:54:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:54:56,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 08:54:56,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 08:54:56,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 210 [2023-08-24 08:54:56,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 948 transitions, 22738 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:54:56,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:54:56,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 210 [2023-08-24 08:54:56,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:55:00,692 INFO L124 PetriNetUnfolderBase]: 16447/21885 cut-off events. [2023-08-24 08:55:00,692 INFO L125 PetriNetUnfolderBase]: For 752881/759425 co-relation queries the response was YES. [2023-08-24 08:55:00,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187361 conditions, 21885 events. 16447/21885 cut-off events. For 752881/759425 co-relation queries the response was YES. Maximal size of possible extension queue 1321. Compared 116096 event pairs, 2290 based on Foata normal form. 4182/24563 useless extension candidates. Maximal degree in co-relation 178660. Up to 15283 conditions per place. [2023-08-24 08:55:00,872 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 375 selfloop transitions, 340 changer transitions 0/806 dead transitions. [2023-08-24 08:55:00,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 806 transitions, 20547 flow [2023-08-24 08:55:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 08:55:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 08:55:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-08-24 08:55:00,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2023-08-24 08:55:00,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-08-24 08:55:00,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-08-24 08:55:00,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:55:00,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-08-24 08:55:00,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:55:00,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:55:00,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:55:00,875 INFO L175 Difference]: Start difference. First operand has 208 places, 948 transitions, 22738 flow. Second operand 3 states and 335 transitions. [2023-08-24 08:55:00,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 806 transitions, 20547 flow [2023-08-24 08:55:05,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 806 transitions, 19358 flow, removed 314 selfloop flow, removed 18 redundant places. [2023-08-24 08:55:05,970 INFO L231 Difference]: Finished difference. Result has 179 places, 781 transitions, 18706 flow [2023-08-24 08:55:05,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=17632, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=340, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=18706, PETRI_PLACES=179, PETRI_TRANSITIONS=781} [2023-08-24 08:55:05,971 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 141 predicate places. [2023-08-24 08:55:05,971 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 781 transitions, 18706 flow [2023-08-24 08:55:05,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:55:05,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:55:05,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:55:05,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-08-24 08:55:05,971 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:55:05,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:55:05,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1209046978, now seen corresponding path program 2 times [2023-08-24 08:55:05,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:55:05,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859971924] [2023-08-24 08:55:05,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:55:05,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:55:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:55:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 08:55:06,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:55:06,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859971924] [2023-08-24 08:55:06,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859971924] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:55:06,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675885673] [2023-08-24 08:55:06,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 08:55:06,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:55:06,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:55:06,086 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 08:55:06,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-24 08:55:06,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 08:55:06,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 08:55:06,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-24 08:55:06,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:55:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 08:55:06,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:55:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 08:55:06,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675885673] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:55:06,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:55:06,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2023-08-24 08:55:06,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788200927] [2023-08-24 08:55:06,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:55:06,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 08:55:06,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:55:06,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 08:55:06,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-24 08:55:06,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 210 [2023-08-24 08:55:06,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 781 transitions, 18706 flow. Second operand has 8 states, 8 states have (on average 109.375) internal successors, (875), 8 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:55:06,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:55:06,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 210 [2023-08-24 08:55:06,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:55:13,119 INFO L124 PetriNetUnfolderBase]: 28637/38943 cut-off events. [2023-08-24 08:55:13,119 INFO L125 PetriNetUnfolderBase]: For 944487/956133 co-relation queries the response was YES. [2023-08-24 08:55:13,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295060 conditions, 38943 events. 28637/38943 cut-off events. For 944487/956133 co-relation queries the response was YES. Maximal size of possible extension queue 2057. Compared 230842 event pairs, 2180 based on Foata normal form. 5912/43739 useless extension candidates. Maximal degree in co-relation 286611. Up to 22234 conditions per place. [2023-08-24 08:55:13,581 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 598 selfloop transitions, 633 changer transitions 4/1310 dead transitions. [2023-08-24 08:55:13,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1310 transitions, 30917 flow [2023-08-24 08:55:13,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 08:55:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 08:55:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 971 transitions. [2023-08-24 08:55:13,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5779761904761904 [2023-08-24 08:55:13,583 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 971 transitions. [2023-08-24 08:55:13,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 971 transitions. [2023-08-24 08:55:13,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:55:13,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 971 transitions. [2023-08-24 08:55:13,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.375) internal successors, (971), 8 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:55:13,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:55:13,585 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:55:13,585 INFO L175 Difference]: Start difference. First operand has 179 places, 781 transitions, 18706 flow. Second operand 8 states and 971 transitions. [2023-08-24 08:55:13,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1310 transitions, 30917 flow [2023-08-24 08:55:25,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 1310 transitions, 29336 flow, removed 78 selfloop flow, removed 6 redundant places. [2023-08-24 08:55:25,910 INFO L231 Difference]: Finished difference. Result has 184 places, 1152 transitions, 28884 flow [2023-08-24 08:55:25,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=12478, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=28884, PETRI_PLACES=184, PETRI_TRANSITIONS=1152} [2023-08-24 08:55:25,911 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 146 predicate places. [2023-08-24 08:55:25,911 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 1152 transitions, 28884 flow [2023-08-24 08:55:25,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.375) internal successors, (875), 8 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:55:25,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:55:25,912 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-24 08:55:25,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-24 08:55:26,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2023-08-24 08:55:26,116 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:55:26,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:55:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash -442734859, now seen corresponding path program 3 times [2023-08-24 08:55:26,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:55:26,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416772965] [2023-08-24 08:55:26,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:55:26,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:55:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:55:26,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 08:55:26,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:55:26,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416772965] [2023-08-24 08:55:26,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416772965] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:55:26,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66969730] [2023-08-24 08:55:26,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 08:55:26,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:55:26,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:55:26,182 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 08:55:26,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-24 08:55:26,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 08:55:26,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 08:55:26,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 08:55:26,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:55:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 08:55:26,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:55:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 08:55:26,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66969730] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:55:26,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:55:26,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-08-24 08:55:26,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923239972] [2023-08-24 08:55:26,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:55:26,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 08:55:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:55:26,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 08:55:26,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-08-24 08:55:26,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 210 [2023-08-24 08:55:26,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 1152 transitions, 28884 flow. Second operand has 13 states, 13 states have (on average 87.6923076923077) internal successors, (1140), 13 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:55:26,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:55:26,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 210 [2023-08-24 08:55:26,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:55:38,470 INFO L124 PetriNetUnfolderBase]: 44547/59178 cut-off events. [2023-08-24 08:55:38,470 INFO L125 PetriNetUnfolderBase]: For 1221507/1224158 co-relation queries the response was YES. [2023-08-24 08:55:38,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449889 conditions, 59178 events. 44547/59178 cut-off events. For 1221507/1224158 co-relation queries the response was YES. Maximal size of possible extension queue 2694. Compared 338415 event pairs, 5588 based on Foata normal form. 2595/61576 useless extension candidates. Maximal degree in co-relation 438290. Up to 30761 conditions per place. [2023-08-24 08:55:39,145 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 1759 selfloop transitions, 1131 changer transitions 23/2927 dead transitions. [2023-08-24 08:55:39,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 2927 transitions, 72018 flow [2023-08-24 08:55:39,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-24 08:55:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-24 08:55:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2695 transitions. [2023-08-24 08:55:39,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425287356321839 [2023-08-24 08:55:39,147 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2695 transitions. [2023-08-24 08:55:39,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2695 transitions. [2023-08-24 08:55:39,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:55:39,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2695 transitions. [2023-08-24 08:55:39,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 92.93103448275862) internal successors, (2695), 29 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:55:39,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 210.0) internal successors, (6300), 30 states have internal predecessors, (6300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:55:39,153 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 210.0) internal successors, (6300), 30 states have internal predecessors, (6300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:55:39,153 INFO L175 Difference]: Start difference. First operand has 184 places, 1152 transitions, 28884 flow. Second operand 29 states and 2695 transitions. [2023-08-24 08:55:39,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 2927 transitions, 72018 flow [2023-08-24 08:56:03,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 2927 transitions, 66226 flow, removed 2896 selfloop flow, removed 0 redundant places. [2023-08-24 08:56:03,854 INFO L231 Difference]: Finished difference. Result has 231 places, 1966 transitions, 48288 flow [2023-08-24 08:56:03,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=27486, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=579, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=48288, PETRI_PLACES=231, PETRI_TRANSITIONS=1966} [2023-08-24 08:56:03,855 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 193 predicate places. [2023-08-24 08:56:03,855 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 1966 transitions, 48288 flow [2023-08-24 08:56:03,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 87.6923076923077) internal successors, (1140), 13 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:56:03,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:56:03,855 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-24 08:56:03,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-24 08:56:04,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:56:04,060 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:56:04,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:56:04,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2007825505, now seen corresponding path program 4 times [2023-08-24 08:56:04,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:56:04,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178867000] [2023-08-24 08:56:04,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:56:04,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:56:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:56:04,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 08:56:04,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:56:04,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178867000] [2023-08-24 08:56:04,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178867000] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:56:04,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216974069] [2023-08-24 08:56:04,111 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 08:56:04,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:56:04,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:56:04,112 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 08:56:04,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-24 08:56:04,218 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 08:56:04,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 08:56:04,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 08:56:04,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:56:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 08:56:04,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:56:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 08:56:04,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216974069] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:56:04,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:56:04,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-08-24 08:56:04,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926221216] [2023-08-24 08:56:04,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:56:04,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 08:56:04,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:56:04,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 08:56:04,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-08-24 08:56:04,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 08:56:04,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 1966 transitions, 48288 flow. Second operand has 13 states, 13 states have (on average 90.84615384615384) internal successors, (1181), 13 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:56:04,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:56:04,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 08:56:04,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand