/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 PROGRAM_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 15:02:34,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 15:02:34,839 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 15:02:34,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 15:02:34,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 15:02:34,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 15:02:34,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 15:02:34,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 15:02:34,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 15:02:34,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 15:02:34,870 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 15:02:34,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 15:02:34,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 15:02:34,872 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 15:02:34,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 15:02:34,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 15:02:34,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 15:02:34,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 15:02:34,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 15:02:34,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 15:02:34,873 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 15:02:34,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 15:02:34,874 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 15:02:34,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 15:02:34,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 15:02:34,875 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 15:02:34,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 15:02:34,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 15:02:34,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 15:02:34,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 15:02:34,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 15:02:34,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 15:02:34,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 15:02:34,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 15:02:34,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 15:02:34,878 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 -> PROGRAM_FIRST [2023-08-24 15:02:35,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 15:02:35,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 15:02:35,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 15:02:35,210 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 15:02:35,210 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 15:02:35,214 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 15:02:36,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 15:02:36,523 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 15:02:36,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-08-24 15:02:36,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff81e8d3/34cd2c736c314f47b3a86d7e0a18ff5d/FLAG4a8e63ac7 [2023-08-24 15:02:36,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff81e8d3/34cd2c736c314f47b3a86d7e0a18ff5d [2023-08-24 15:02:36,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 15:02:36,542 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 15:02:36,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 15:02:36,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 15:02:36,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 15:02:36,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 03:02:36" (1/1) ... [2023-08-24 15:02:36,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45e9f9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:02:36, skipping insertion in model container [2023-08-24 15:02:36,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 03:02:36" (1/1) ... [2023-08-24 15:02:36,568 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 15:02:36,742 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 15:02:36,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 15:02:36,752 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 15:02:36,792 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 15:02:36,793 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 15:02:36,799 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 15:02:36,799 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 15:02:36,805 INFO L206 MainTranslator]: Completed translation [2023-08-24 15:02:36,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:02:36 WrapperNode [2023-08-24 15:02:36,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 15:02:36,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 15:02:36,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 15:02:36,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 15:02:36,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:02:36" (1/1) ... [2023-08-24 15:02:36,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:02:36" (1/1) ... [2023-08-24 15:02:36,858 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 119 [2023-08-24 15:02:36,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 15:02:36,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 15:02:36,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 15:02:36,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 15:02:36,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:02:36" (1/1) ... [2023-08-24 15:02:36,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:02:36" (1/1) ... [2023-08-24 15:02:36,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:02:36" (1/1) ... [2023-08-24 15:02:36,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:02:36" (1/1) ... [2023-08-24 15:02:36,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:02:36" (1/1) ... [2023-08-24 15:02:36,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:02:36" (1/1) ... [2023-08-24 15:02:36,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:02:36" (1/1) ... [2023-08-24 15:02:36,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:02:36" (1/1) ... [2023-08-24 15:02:36,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 15:02:36,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 15:02:36,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 15:02:36,904 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 15:02:36,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:02:36" (1/1) ... [2023-08-24 15:02:36,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 15:02:36,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:02:36,934 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 15:02:36,958 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 15:02:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 15:02:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 15:02:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 15:02:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 15:02:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 15:02:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 15:02:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 15:02:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 15:02:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 15:02:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 15:02:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 15:02:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 15:02:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 15:02:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 15:02:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 15:02:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 15:02:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 15:02:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 15:02:36,976 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 15:02:37,091 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 15:02:37,093 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 15:02:37,301 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 15:02:37,347 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 15:02:37,347 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 15:02:37,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 03:02:37 BoogieIcfgContainer [2023-08-24 15:02:37,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 15:02:37,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 15:02:37,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 15:02:37,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 15:02:37,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 03:02:36" (1/3) ... [2023-08-24 15:02:37,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d96e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 03:02:37, skipping insertion in model container [2023-08-24 15:02:37,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:02:36" (2/3) ... [2023-08-24 15:02:37,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d96e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 03:02:37, skipping insertion in model container [2023-08-24 15:02:37,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 03:02:37" (3/3) ... [2023-08-24 15:02:37,360 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2023-08-24 15:02:37,373 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 15:02:37,373 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 15:02:37,373 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 15:02:37,438 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-24 15:02:37,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 124 transitions, 280 flow [2023-08-24 15:02:37,553 INFO L124 PetriNetUnfolderBase]: 9/120 cut-off events. [2023-08-24 15:02:37,553 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 15:02:37,560 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 15:02:37,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 124 transitions, 280 flow [2023-08-24 15:02:37,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 108 transitions, 240 flow [2023-08-24 15:02:37,568 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 15:02:37,580 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 108 transitions, 240 flow [2023-08-24 15:02:37,582 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 108 transitions, 240 flow [2023-08-24 15:02:37,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 108 transitions, 240 flow [2023-08-24 15:02:37,608 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-08-24 15:02:37,608 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 15:02:37,616 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 15:02:37,619 INFO L119 LiptonReduction]: Number of co-enabled transitions 2904 [2023-08-24 15:02:40,711 INFO L134 LiptonReduction]: Checked pairs total: 2832 [2023-08-24 15:02:40,711 INFO L136 LiptonReduction]: Total number of compositions: 86 [2023-08-24 15:02:40,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 15:02:40,727 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;@3a19f6d3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 15:02:40,727 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 15:02:40,734 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 15:02:40,734 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2023-08-24 15:02:40,734 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 15:02:40,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:02:40,735 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 15:02:40,736 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 15:02:40,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:02:40,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1027665342, now seen corresponding path program 1 times [2023-08-24 15:02:40,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:02:40,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479868828] [2023-08-24 15:02:40,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:40,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:02:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:41,230 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 15:02:41,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:02:41,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479868828] [2023-08-24 15:02:41,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479868828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:02:41,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:02:41,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 15:02:41,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447842064] [2023-08-24 15:02:41,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:02:41,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 15:02:41,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:02:41,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 15:02:41,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 15:02:41,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 210 [2023-08-24 15:02:41,271 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 15:02:41,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:02:41,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 210 [2023-08-24 15:02:41,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:02:41,523 INFO L124 PetriNetUnfolderBase]: 1537/1954 cut-off events. [2023-08-24 15:02:41,523 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2023-08-24 15:02:41,527 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 15:02:41,540 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-08-24 15:02:41,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 241 flow [2023-08-24 15:02:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 15:02:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 15:02:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-24 15:02:41,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2023-08-24 15:02:41,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-24 15:02:41,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-24 15:02:41,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:02:41,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-24 15:02:41,560 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 15:02:41,564 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 15:02:41,564 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 15:02:41,566 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 82 flow. Second operand 3 states and 357 transitions. [2023-08-24 15:02:41,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 241 flow [2023-08-24 15:02:41,571 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 15:02:41,572 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 99 flow [2023-08-24 15:02:41,574 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 15:02:41,576 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2023-08-24 15:02:41,576 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 99 flow [2023-08-24 15:02:41,577 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 15:02:41,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:02:41,577 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 15:02:41,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 15:02:41,577 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 15:02:41,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:02:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1895265813, now seen corresponding path program 1 times [2023-08-24 15:02:41,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:02:41,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929849489] [2023-08-24 15:02:41,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:41,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:02:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:41,667 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 15:02:41,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:02:41,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929849489] [2023-08-24 15:02:41,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929849489] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:02:41,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:02:41,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:02:41,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369047123] [2023-08-24 15:02:41,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:02:41,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:02:41,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:02:41,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:02:41,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:02:41,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:02:41,672 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 15:02:41,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:02:41,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:02:41,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:02:41,990 INFO L124 PetriNetUnfolderBase]: 2533/3290 cut-off events. [2023-08-24 15:02:41,991 INFO L125 PetriNetUnfolderBase]: For 1011/1011 co-relation queries the response was YES. [2023-08-24 15:02:41,995 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 15:02:42,011 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 83 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2023-08-24 15:02:42,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 91 transitions, 450 flow [2023-08-24 15:02:42,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:02:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:02:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-24 15:02:42,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2023-08-24 15:02:42,019 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-24 15:02:42,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-24 15:02:42,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:02:42,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-24 15:02:42,021 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 15:02:42,025 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 15:02:42,025 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 15:02:42,026 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 99 flow. Second operand 5 states and 518 transitions. [2023-08-24 15:02:42,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 91 transitions, 450 flow [2023-08-24 15:02:42,028 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 15:02:42,030 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 137 flow [2023-08-24 15:02:42,031 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 15:02:42,032 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2023-08-24 15:02:42,034 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 137 flow [2023-08-24 15:02:42,035 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 15:02:42,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:02:42,039 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 15:02:42,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 15:02:42,039 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 15:02:42,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:02:42,041 INFO L85 PathProgramCache]: Analyzing trace with hash -744169450, now seen corresponding path program 1 times [2023-08-24 15:02:42,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:02:42,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522085431] [2023-08-24 15:02:42,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:42,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:02:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:42,121 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 15:02:42,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:02:42,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522085431] [2023-08-24 15:02:42,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522085431] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:02:42,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59901252] [2023-08-24 15:02:42,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:42,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:02:42,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:02:42,129 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 15:02:42,156 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 15:02:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:42,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 15:02:42,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:02:42,305 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 15:02:42,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:02:42,331 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 15:02:42,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59901252] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:02:42,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:02:42,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-24 15:02:42,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708326169] [2023-08-24 15:02:42,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:02:42,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 15:02:42,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:02:42,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 15:02:42,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-24 15:02:42,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:02:42,335 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 15:02:42,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:02:42,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:02:42,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:02:42,890 INFO L124 PetriNetUnfolderBase]: 3356/4459 cut-off events. [2023-08-24 15:02:42,890 INFO L125 PetriNetUnfolderBase]: For 4057/4547 co-relation queries the response was YES. [2023-08-24 15:02:42,895 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 15:02:42,916 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 116 selfloop transitions, 10 changer transitions 0/129 dead transitions. [2023-08-24 15:02:42,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 129 transitions, 742 flow [2023-08-24 15:02:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 15:02:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 15:02:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 719 transitions. [2023-08-24 15:02:42,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891156462585034 [2023-08-24 15:02:42,919 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 719 transitions. [2023-08-24 15:02:42,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 719 transitions. [2023-08-24 15:02:42,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:02:42,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 719 transitions. [2023-08-24 15:02:42,921 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 15:02:42,924 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 15:02:42,924 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 15:02:42,924 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 137 flow. Second operand 7 states and 719 transitions. [2023-08-24 15:02:42,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 129 transitions, 742 flow [2023-08-24 15:02:42,937 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 15:02:42,938 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 202 flow [2023-08-24 15:02:42,939 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 15:02:42,940 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2023-08-24 15:02:42,940 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 202 flow [2023-08-24 15:02:42,942 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 15:02:42,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:02:42,942 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 15:02:42,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-24 15:02:43,147 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 15:02:43,147 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 15:02:43,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:02:43,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2074666379, now seen corresponding path program 1 times [2023-08-24 15:02:43,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:02:43,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883607534] [2023-08-24 15:02:43,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:43,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:02:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:43,215 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 15:02:43,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:02:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883607534] [2023-08-24 15:02:43,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883607534] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:02:43,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880797682] [2023-08-24 15:02:43,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:43,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:02:43,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:02:43,217 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 15:02:43,236 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 15:02:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:43,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 15:02:43,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:02:43,334 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 15:02:43,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:02:43,380 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 15:02:43,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880797682] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:02:43,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:02:43,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-24 15:02:43,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51811106] [2023-08-24 15:02:43,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:02:43,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 15:02:43,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:02:43,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 15:02:43,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-24 15:02:43,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:02:43,385 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 15:02:43,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:02:43,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:02:43,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:02:43,916 INFO L124 PetriNetUnfolderBase]: 3797/5007 cut-off events. [2023-08-24 15:02:43,916 INFO L125 PetriNetUnfolderBase]: For 9696/10023 co-relation queries the response was YES. [2023-08-24 15:02:43,922 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 15:02:43,945 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 129 selfloop transitions, 18 changer transitions 0/150 dead transitions. [2023-08-24 15:02:43,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 150 transitions, 1018 flow [2023-08-24 15:02:43,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 15:02:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 15:02:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 719 transitions. [2023-08-24 15:02:43,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891156462585034 [2023-08-24 15:02:43,948 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 719 transitions. [2023-08-24 15:02:43,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 719 transitions. [2023-08-24 15:02:43,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:02:43,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 719 transitions. [2023-08-24 15:02:43,950 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 15:02:43,952 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 15:02:43,952 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 15:02:43,953 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 202 flow. Second operand 7 states and 719 transitions. [2023-08-24 15:02:43,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 150 transitions, 1018 flow [2023-08-24 15:02:43,969 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 15:02:43,970 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 366 flow [2023-08-24 15:02:43,971 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 15:02:43,971 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2023-08-24 15:02:43,971 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 366 flow [2023-08-24 15:02:43,972 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 15:02:43,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:02:43,972 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 15:02:43,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-24 15:02:44,176 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 15:02:44,177 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 15:02:44,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:02:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1944302148, now seen corresponding path program 1 times [2023-08-24 15:02:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:02:44,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394616332] [2023-08-24 15:02:44,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:44,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:02:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:44,246 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 15:02:44,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:02:44,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394616332] [2023-08-24 15:02:44,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394616332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:02:44,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:02:44,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:02:44,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549622393] [2023-08-24 15:02:44,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:02:44,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:02:44,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:02:44,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:02:44,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:02:44,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:02:44,249 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 15:02:44,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:02:44,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:02:44,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:02:44,864 INFO L124 PetriNetUnfolderBase]: 5405/7069 cut-off events. [2023-08-24 15:02:44,864 INFO L125 PetriNetUnfolderBase]: For 28345/28706 co-relation queries the response was YES. [2023-08-24 15:02:44,876 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 15:02:44,909 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 87 selfloop transitions, 30 changer transitions 2/122 dead transitions. [2023-08-24 15:02:44,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 122 transitions, 970 flow [2023-08-24 15:02:44,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:02:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:02:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-24 15:02:44,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847619047619048 [2023-08-24 15:02:44,911 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-24 15:02:44,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-24 15:02:44,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:02:44,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-24 15:02:44,913 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 15:02:44,914 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 15:02:44,915 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 15:02:44,915 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 366 flow. Second operand 5 states and 509 transitions. [2023-08-24 15:02:44,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 122 transitions, 970 flow [2023-08-24 15:02:44,975 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 15:02:44,976 INFO L231 Difference]: Finished difference. Result has 62 places, 69 transitions, 558 flow [2023-08-24 15:02:44,976 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 15:02:44,977 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2023-08-24 15:02:44,977 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 69 transitions, 558 flow [2023-08-24 15:02:44,977 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 15:02:44,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:02:44,977 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 15:02:44,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 15:02:44,978 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 15:02:44,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:02:44,978 INFO L85 PathProgramCache]: Analyzing trace with hash -696078719, now seen corresponding path program 2 times [2023-08-24 15:02:44,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:02:44,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000306849] [2023-08-24 15:02:44,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:44,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:02:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:45,042 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 15:02:45,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:02:45,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000306849] [2023-08-24 15:02:45,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000306849] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:02:45,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:02:45,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:02:45,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3867503] [2023-08-24 15:02:45,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:02:45,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:02:45,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:02:45,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:02:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:02:45,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:02:45,045 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 15:02:45,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:02:45,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:02:45,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:02:45,644 INFO L124 PetriNetUnfolderBase]: 5508/7313 cut-off events. [2023-08-24 15:02:45,644 INFO L125 PetriNetUnfolderBase]: For 44725/45718 co-relation queries the response was YES. [2023-08-24 15:02:45,659 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 15:02:45,695 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 128 selfloop transitions, 12 changer transitions 0/150 dead transitions. [2023-08-24 15:02:45,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 150 transitions, 1373 flow [2023-08-24 15:02:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:02:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:02:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2023-08-24 15:02:45,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2023-08-24 15:02:45,697 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2023-08-24 15:02:45,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2023-08-24 15:02:45,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:02:45,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2023-08-24 15:02:45,698 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 15:02:45,700 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 15:02:45,700 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 15:02:45,700 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 558 flow. Second operand 5 states and 516 transitions. [2023-08-24 15:02:45,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 150 transitions, 1373 flow [2023-08-24 15:02:45,860 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 15:02:45,861 INFO L231 Difference]: Finished difference. Result has 68 places, 73 transitions, 580 flow [2023-08-24 15:02:45,861 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 15:02:45,862 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2023-08-24 15:02:45,862 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 73 transitions, 580 flow [2023-08-24 15:02:45,862 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 15:02:45,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:02:45,863 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 15:02:45,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 15:02:45,863 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 15:02:45,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:02:45,863 INFO L85 PathProgramCache]: Analyzing trace with hash -312159770, now seen corresponding path program 2 times [2023-08-24 15:02:45,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:02:45,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145633634] [2023-08-24 15:02:45,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:45,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:02:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:45,926 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 15:02:45,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:02:45,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145633634] [2023-08-24 15:02:45,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145633634] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:02:45,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540743445] [2023-08-24 15:02:45,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 15:02:45,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:02:45,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:02:45,928 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 15:02:45,974 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 15:02:46,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:02:46,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:02:46,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 15:02:46,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:02:46,098 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 15:02:46,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:02:46,122 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 15:02:46,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540743445] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:02:46,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:02:46,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-24 15:02:46,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672883654] [2023-08-24 15:02:46,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:02:46,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 15:02:46,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:02:46,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 15:02:46,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-24 15:02:46,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:02:46,126 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 15:02:46,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:02:46,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:02:46,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:02:46,962 INFO L124 PetriNetUnfolderBase]: 6648/8713 cut-off events. [2023-08-24 15:02:46,963 INFO L125 PetriNetUnfolderBase]: For 40036/40644 co-relation queries the response was YES. [2023-08-24 15:02:46,978 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 15:02:47,012 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 178 selfloop transitions, 42 changer transitions 0/225 dead transitions. [2023-08-24 15:02:47,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 225 transitions, 1995 flow [2023-08-24 15:02:47,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 15:02:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 15:02:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1012 transitions. [2023-08-24 15:02:47,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819047619047619 [2023-08-24 15:02:47,016 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1012 transitions. [2023-08-24 15:02:47,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1012 transitions. [2023-08-24 15:02:47,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:02:47,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1012 transitions. [2023-08-24 15:02:47,018 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 15:02:47,021 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 15:02:47,022 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 15:02:47,022 INFO L175 Difference]: Start difference. First operand has 68 places, 73 transitions, 580 flow. Second operand 10 states and 1012 transitions. [2023-08-24 15:02:47,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 225 transitions, 1995 flow [2023-08-24 15:02:47,202 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 15:02:47,204 INFO L231 Difference]: Finished difference. Result has 81 places, 102 transitions, 1066 flow [2023-08-24 15:02:47,204 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 15:02:47,205 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 43 predicate places. [2023-08-24 15:02:47,205 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 102 transitions, 1066 flow [2023-08-24 15:02:47,205 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 15:02:47,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:02:47,206 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 15:02:47,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 15:02:47,406 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 15:02:47,407 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 15:02:47,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:02:47,407 INFO L85 PathProgramCache]: Analyzing trace with hash 612071379, now seen corresponding path program 3 times [2023-08-24 15:02:47,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:02:47,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832743605] [2023-08-24 15:02:47,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:47,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:02:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:47,479 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 15:02:47,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:02:47,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832743605] [2023-08-24 15:02:47,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832743605] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:02:47,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:02:47,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:02:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682315582] [2023-08-24 15:02:47,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:02:47,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:02:47,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:02:47,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:02:47,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:02:47,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:02:47,489 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 15:02:47,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:02:47,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:02:47,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:02:48,271 INFO L124 PetriNetUnfolderBase]: 7279/9861 cut-off events. [2023-08-24 15:02:48,271 INFO L125 PetriNetUnfolderBase]: For 55716/56163 co-relation queries the response was YES. [2023-08-24 15:02:48,295 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 15:02:48,342 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 117 selfloop transitions, 55 changer transitions 3/178 dead transitions. [2023-08-24 15:02:48,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 178 transitions, 1881 flow [2023-08-24 15:02:48,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:02:48,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:02:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2023-08-24 15:02:48,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895238095238095 [2023-08-24 15:02:48,345 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 514 transitions. [2023-08-24 15:02:48,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 514 transitions. [2023-08-24 15:02:48,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:02:48,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 514 transitions. [2023-08-24 15:02:48,346 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 15:02:48,348 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 15:02:48,348 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 15:02:48,348 INFO L175 Difference]: Start difference. First operand has 81 places, 102 transitions, 1066 flow. Second operand 5 states and 514 transitions. [2023-08-24 15:02:48,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 178 transitions, 1881 flow [2023-08-24 15:02:48,628 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 15:02:48,629 INFO L231 Difference]: Finished difference. Result has 84 places, 108 transitions, 1155 flow [2023-08-24 15:02:48,630 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 15:02:48,630 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2023-08-24 15:02:48,630 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 108 transitions, 1155 flow [2023-08-24 15:02:48,631 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 15:02:48,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:02:48,631 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 15:02:48,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 15:02:48,631 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 15:02:48,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:02:48,631 INFO L85 PathProgramCache]: Analyzing trace with hash 666235612, now seen corresponding path program 2 times [2023-08-24 15:02:48,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:02:48,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834716356] [2023-08-24 15:02:48,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:48,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:02:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:48,690 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 15:02:48,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:02:48,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834716356] [2023-08-24 15:02:48,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834716356] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:02:48,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:02:48,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:02:48,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930373183] [2023-08-24 15:02:48,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:02:48,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:02:48,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:02:48,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:02:48,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:02:48,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:02:48,694 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 15:02:48,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:02:48,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:02:48,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:02:49,388 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 15:02:49,388 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 15:02:49,389 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:02:49,389 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:02:49,389 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:02:49,461 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 15:02:49,461 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-24 15:02:49,462 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:02:49,462 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 15:02:49,462 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:02:49,512 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 15:02:49,513 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-24 15:02:49,513 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 15:02:49,513 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 15:02:49,513 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 15:02:49,550 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 15:02:49,550 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 15:02:49,550 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 15:02:49,550 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 15:02:49,550 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 15:02:49,699 INFO L124 PetriNetUnfolderBase]: 8277/10967 cut-off events. [2023-08-24 15:02:49,700 INFO L125 PetriNetUnfolderBase]: For 76737/77614 co-relation queries the response was YES. [2023-08-24 15:02:49,717 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 15:02:49,758 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 107 selfloop transitions, 51 changer transitions 0/167 dead transitions. [2023-08-24 15:02:49,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 167 transitions, 1827 flow [2023-08-24 15:02:49,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:02:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:02:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-08-24 15:02:49,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876190476190476 [2023-08-24 15:02:49,761 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-08-24 15:02:49,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-08-24 15:02:49,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:02:49,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-08-24 15:02:49,762 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 15:02:49,764 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 15:02:49,764 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 15:02:49,764 INFO L175 Difference]: Start difference. First operand has 84 places, 108 transitions, 1155 flow. Second operand 5 states and 512 transitions. [2023-08-24 15:02:49,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 167 transitions, 1827 flow [2023-08-24 15:02:49,943 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 15:02:49,946 INFO L231 Difference]: Finished difference. Result has 88 places, 110 transitions, 1216 flow [2023-08-24 15:02:49,946 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 15:02:49,947 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2023-08-24 15:02:49,947 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 110 transitions, 1216 flow [2023-08-24 15:02:49,947 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 15:02:49,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:02:49,947 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 15:02:49,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 15:02:49,947 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 15:02:49,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:02:49,948 INFO L85 PathProgramCache]: Analyzing trace with hash -495897952, now seen corresponding path program 3 times [2023-08-24 15:02:49,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:02:49,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759044342] [2023-08-24 15:02:49,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:49,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:02:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:50,005 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 15:02:50,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:02:50,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759044342] [2023-08-24 15:02:50,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759044342] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:02:50,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:02:50,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:02:50,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340220800] [2023-08-24 15:02:50,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:02:50,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:02:50,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:02:50,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:02:50,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:02:50,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:02:50,008 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 15:02:50,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:02:50,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:02:50,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:02:50,587 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 15:02:50,587 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 15:02:50,587 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 15:02:50,587 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 15:02:50,587 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:02:50,676 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 15:02:50,676 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 15:02:50,676 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:02:50,676 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:02:50,676 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:02:50,740 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 15:02:50,740 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-24 15:02:50,740 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:02:50,740 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 15:02:50,740 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:02:50,973 INFO L124 PetriNetUnfolderBase]: 8797/11661 cut-off events. [2023-08-24 15:02:50,973 INFO L125 PetriNetUnfolderBase]: For 104102/105565 co-relation queries the response was YES. [2023-08-24 15:02:50,993 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 15:02:51,041 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 207 selfloop transitions, 11 changer transitions 3/240 dead transitions. [2023-08-24 15:02:51,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 240 transitions, 2862 flow [2023-08-24 15:02:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:02:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:02:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-24 15:02:51,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2023-08-24 15:02:51,044 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-24 15:02:51,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-24 15:02:51,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:02:51,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-24 15:02:51,045 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 15:02:51,047 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 15:02:51,048 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 15:02:51,048 INFO L175 Difference]: Start difference. First operand has 88 places, 110 transitions, 1216 flow. Second operand 5 states and 518 transitions. [2023-08-24 15:02:51,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 240 transitions, 2862 flow [2023-08-24 15:02:51,258 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 15:02:51,260 INFO L231 Difference]: Finished difference. Result has 92 places, 115 transitions, 1253 flow [2023-08-24 15:02:51,260 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 15:02:51,261 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2023-08-24 15:02:51,261 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 115 transitions, 1253 flow [2023-08-24 15:02:51,261 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 15:02:51,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:02:51,261 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 15:02:51,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 15:02:51,262 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 15:02:51,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:02:51,262 INFO L85 PathProgramCache]: Analyzing trace with hash 982669773, now seen corresponding path program 2 times [2023-08-24 15:02:51,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:02:51,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089638511] [2023-08-24 15:02:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:51,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:02:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:51,351 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 15:02:51,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:02:51,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089638511] [2023-08-24 15:02:51,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089638511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:02:51,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:02:51,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:02:51,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855857732] [2023-08-24 15:02:51,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:02:51,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:02:51,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:02:51,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:02:51,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:02:51,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:02:51,354 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 15:02:51,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:02:51,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:02:51,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:02:52,353 INFO L124 PetriNetUnfolderBase]: 8636/11586 cut-off events. [2023-08-24 15:02:52,353 INFO L125 PetriNetUnfolderBase]: For 97095/98373 co-relation queries the response was YES. [2023-08-24 15:02:52,379 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 15:02:52,536 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 151 selfloop transitions, 18 changer transitions 4/192 dead transitions. [2023-08-24 15:02:52,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 192 transitions, 2183 flow [2023-08-24 15:02:52,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:02:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:02:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2023-08-24 15:02:52,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895238095238095 [2023-08-24 15:02:52,538 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 514 transitions. [2023-08-24 15:02:52,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 514 transitions. [2023-08-24 15:02:52,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:02:52,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 514 transitions. [2023-08-24 15:02:52,540 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 15:02:52,541 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 15:02:52,541 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 15:02:52,542 INFO L175 Difference]: Start difference. First operand has 92 places, 115 transitions, 1253 flow. Second operand 5 states and 514 transitions. [2023-08-24 15:02:52,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 192 transitions, 2183 flow [2023-08-24 15:02:52,792 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 15:02:52,794 INFO L231 Difference]: Finished difference. Result has 96 places, 117 transitions, 1316 flow [2023-08-24 15:02:52,794 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 15:02:52,794 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 58 predicate places. [2023-08-24 15:02:52,795 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 117 transitions, 1316 flow [2023-08-24 15:02:52,795 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 15:02:52,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:02:52,795 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 15:02:52,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 15:02:52,795 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 15:02:52,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:02:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1195941933, now seen corresponding path program 3 times [2023-08-24 15:02:52,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:02:52,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833213627] [2023-08-24 15:02:52,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:02:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:52,863 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 15:02:52,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:02:52,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833213627] [2023-08-24 15:02:52,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833213627] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:02:52,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562005968] [2023-08-24 15:02:52,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 15:02:52,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:02:52,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:02:52,864 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 15:02:52,874 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 15:02:52,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 15:02:52,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:02:52,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 15:02:52,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:02:53,024 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 15:02:53,025 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:02:53,067 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 15:02:53,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562005968] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:02:53,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:02:53,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-24 15:02:53,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521707019] [2023-08-24 15:02:53,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:02:53,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 15:02:53,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:02:53,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 15:02:53,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-24 15:02:53,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:02:53,072 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 15:02:53,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:02:53,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:02:53,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:02:54,399 INFO L124 PetriNetUnfolderBase]: 11456/15071 cut-off events. [2023-08-24 15:02:54,399 INFO L125 PetriNetUnfolderBase]: For 141161/142507 co-relation queries the response was YES. [2023-08-24 15:02:54,432 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 15:02:54,483 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 273 selfloop transitions, 92 changer transitions 5/381 dead transitions. [2023-08-24 15:02:54,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 381 transitions, 4827 flow [2023-08-24 15:02:54,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 15:02:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 15:02:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1004 transitions. [2023-08-24 15:02:54,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4780952380952381 [2023-08-24 15:02:54,486 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1004 transitions. [2023-08-24 15:02:54,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1004 transitions. [2023-08-24 15:02:54,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:02:54,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1004 transitions. [2023-08-24 15:02:54,490 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 15:02:54,492 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 15:02:54,493 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 15:02:54,493 INFO L175 Difference]: Start difference. First operand has 96 places, 117 transitions, 1316 flow. Second operand 10 states and 1004 transitions. [2023-08-24 15:02:54,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 381 transitions, 4827 flow [2023-08-24 15:02:54,897 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 15:02:54,901 INFO L231 Difference]: Finished difference. Result has 109 places, 185 transitions, 2668 flow [2023-08-24 15:02:54,901 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 15:02:54,901 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 71 predicate places. [2023-08-24 15:02:54,901 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 185 transitions, 2668 flow [2023-08-24 15:02:54,902 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 15:02:54,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:02:54,903 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 15:02:54,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 15:02:55,107 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 15:02:55,108 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 15:02:55,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:02:55,108 INFO L85 PathProgramCache]: Analyzing trace with hash -396821945, now seen corresponding path program 4 times [2023-08-24 15:02:55,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:02:55,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309028865] [2023-08-24 15:02:55,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:55,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:02:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:55,186 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 15:02:55,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:02:55,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309028865] [2023-08-24 15:02:55,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309028865] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:02:55,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:02:55,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:02:55,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843541817] [2023-08-24 15:02:55,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:02:55,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:02:55,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:02:55,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:02:55,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:02:55,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:02:55,189 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 15:02:55,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:02:55,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:02:55,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:02:57,078 INFO L124 PetriNetUnfolderBase]: 13707/18240 cut-off events. [2023-08-24 15:02:57,078 INFO L125 PetriNetUnfolderBase]: For 204573/205459 co-relation queries the response was YES. [2023-08-24 15:02:57,123 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 15:02:57,192 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 139 selfloop transitions, 215 changer transitions 3/364 dead transitions. [2023-08-24 15:02:57,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 364 transitions, 5858 flow [2023-08-24 15:02:57,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:02:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:02:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-24 15:02:57,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847619047619048 [2023-08-24 15:02:57,194 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-24 15:02:57,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-24 15:02:57,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:02:57,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-24 15:02:57,196 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 15:02:57,197 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 15:02:57,197 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 15:02:57,198 INFO L175 Difference]: Start difference. First operand has 109 places, 185 transitions, 2668 flow. Second operand 5 states and 509 transitions. [2023-08-24 15:02:57,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 364 transitions, 5858 flow [2023-08-24 15:02:58,369 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 15:02:58,373 INFO L231 Difference]: Finished difference. Result has 112 places, 290 transitions, 4727 flow [2023-08-24 15:02:58,373 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 15:02:58,374 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 74 predicate places. [2023-08-24 15:02:58,374 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 290 transitions, 4727 flow [2023-08-24 15:02:58,374 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 15:02:58,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:02:58,374 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 15:02:58,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 15:02:58,375 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 15:02:58,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:02:58,375 INFO L85 PathProgramCache]: Analyzing trace with hash -122250803, now seen corresponding path program 4 times [2023-08-24 15:02:58,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:02:58,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433590236] [2023-08-24 15:02:58,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:02:58,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:02:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:02:58,444 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 15:02:58,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:02:58,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433590236] [2023-08-24 15:02:58,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433590236] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:02:58,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:02:58,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:02:58,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595497106] [2023-08-24 15:02:58,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:02:58,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:02:58,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:02:58,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:02:58,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:02:58,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:02:58,448 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 15:02:58,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:02:58,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:02:58,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:03:00,470 INFO L124 PetriNetUnfolderBase]: 13387/17607 cut-off events. [2023-08-24 15:03:00,470 INFO L125 PetriNetUnfolderBase]: For 287737/290377 co-relation queries the response was YES. [2023-08-24 15:03:00,511 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 15:03:00,575 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 331 selfloop transitions, 49 changer transitions 4/399 dead transitions. [2023-08-24 15:03:00,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 399 transitions, 6965 flow [2023-08-24 15:03:00,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:03:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:03:00,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-08-24 15:03:00,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47904761904761906 [2023-08-24 15:03:00,577 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-08-24 15:03:00,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-08-24 15:03:00,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:03:00,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-08-24 15:03:00,579 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 15:03:00,580 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 15:03:00,581 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 15:03:00,581 INFO L175 Difference]: Start difference. First operand has 112 places, 290 transitions, 4727 flow. Second operand 5 states and 503 transitions. [2023-08-24 15:03:00,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 399 transitions, 6965 flow [2023-08-24 15:03:01,436 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 15:03:01,441 INFO L231 Difference]: Finished difference. Result has 115 places, 291 transitions, 4610 flow [2023-08-24 15:03:01,441 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 15:03:01,441 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 77 predicate places. [2023-08-24 15:03:01,441 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 291 transitions, 4610 flow [2023-08-24 15:03:01,442 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 15:03:01,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:03:01,442 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 15:03:01,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 15:03:01,442 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 15:03:01,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:03:01,443 INFO L85 PathProgramCache]: Analyzing trace with hash 310949959, now seen corresponding path program 5 times [2023-08-24 15:03:01,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:03:01,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923817174] [2023-08-24 15:03:01,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:03:01,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:03:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:03:01,509 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 15:03:01,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:03:01,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923817174] [2023-08-24 15:03:01,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923817174] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:03:01,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014484425] [2023-08-24 15:03:01,509 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 15:03:01,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:03:01,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:03:01,510 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 15:03:01,513 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 15:03:01,598 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:03:01,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:03:01,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 15:03:01,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:03:01,633 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 15:03:01,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:03:01,654 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 15:03:01,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014484425] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:03:01,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:03:01,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-24 15:03:01,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48797174] [2023-08-24 15:03:01,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:03:01,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 15:03:01,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:03:01,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 15:03:01,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-24 15:03:01,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:03:01,657 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 15:03:01,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:03:01,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:03:01,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:03:02,531 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 15:03:02,531 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,531 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-24 15:03:02,531 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-24 15:03:02,531 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,532 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 15:03:02,532 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,532 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-24 15:03:02,533 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-24 15:03:02,533 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,844 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 15:03:02,845 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-24 15:03:02,845 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,845 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 15:03:02,845 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,845 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 15:03:02,845 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-24 15:03:02,845 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,845 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 15:03:02,845 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,905 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 15:03:02,905 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-24 15:03:02,905 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,905 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,905 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,906 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 15:03:02,906 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-24 15:03:02,906 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,906 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,906 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,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][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 15:03:02,907 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-24 15:03:02,907 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,907 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 15:03:02,907 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-24 15:03:02,963 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 15:03:02,963 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 15:03:02,963 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:03:02,963 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:03:02,963 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:03:03,070 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 15:03:03,070 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 15:03:03,070 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 15:03:03,070 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 15:03:03,070 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 15:03:03,070 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 15:03:03,070 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 15:03:03,070 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 15:03:03,070 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 15:03:03,071 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 15:03:03,111 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 15:03:03,111 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 15:03:03,111 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 15:03:03,111 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 15:03:03,111 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-24 15:03:03,162 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 15:03:03,162 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 15:03:03,162 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:03:03,162 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:03:03,162 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:03:03,163 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 15:03:03,163 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 15:03:03,163 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:03:03,163 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:03:03,163 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:03:03,305 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 15:03:03,306 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-24 15:03:03,306 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 15:03:03,306 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 15:03:03,306 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 15:03:03,780 INFO L124 PetriNetUnfolderBase]: 13446/17742 cut-off events. [2023-08-24 15:03:03,781 INFO L125 PetriNetUnfolderBase]: For 272389/274979 co-relation queries the response was YES. [2023-08-24 15:03:03,826 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 15:03:03,893 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 153 selfloop transitions, 277 changer transitions 3/448 dead transitions. [2023-08-24 15:03:03,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 448 transitions, 7829 flow [2023-08-24 15:03:03,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 15:03:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 15:03:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-08-24 15:03:03,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2023-08-24 15:03:03,894 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-08-24 15:03:03,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-08-24 15:03:03,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:03:03,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-08-24 15:03:03,896 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 15:03:03,898 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 15:03:03,898 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 15:03:03,898 INFO L175 Difference]: Start difference. First operand has 115 places, 291 transitions, 4610 flow. Second operand 6 states and 606 transitions. [2023-08-24 15:03:03,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 448 transitions, 7829 flow [2023-08-24 15:03:05,100 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 15:03:05,106 INFO L231 Difference]: Finished difference. Result has 120 places, 367 transitions, 6979 flow [2023-08-24 15:03:05,106 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 15:03:05,107 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 82 predicate places. [2023-08-24 15:03:05,107 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 367 transitions, 6979 flow [2023-08-24 15:03:05,107 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 15:03:05,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:03:05,107 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 15:03:05,113 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 15:03:05,308 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 15:03:05,309 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 15:03:05,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:03:05,310 INFO L85 PathProgramCache]: Analyzing trace with hash 115981662, now seen corresponding path program 4 times [2023-08-24 15:03:05,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:03:05,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764632175] [2023-08-24 15:03:05,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:03:05,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:03:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:03:05,401 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 15:03:05,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:03:05,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764632175] [2023-08-24 15:03:05,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764632175] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:03:05,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:03:05,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:03:05,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014244180] [2023-08-24 15:03:05,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:03:05,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:03:05,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:03:05,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:03:05,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:03:05,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:03:05,404 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 15:03:05,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:03:05,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:03:05,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:03:07,735 INFO L124 PetriNetUnfolderBase]: 13493/17913 cut-off events. [2023-08-24 15:03:07,735 INFO L125 PetriNetUnfolderBase]: For 288643/291280 co-relation queries the response was YES. [2023-08-24 15:03:07,792 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 15:03:08,050 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 140 selfloop transitions, 274 changer transitions 5/435 dead transitions. [2023-08-24 15:03:08,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 435 transitions, 8419 flow [2023-08-24 15:03:08,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:03:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:03:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-08-24 15:03:08,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876190476190476 [2023-08-24 15:03:08,052 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-08-24 15:03:08,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-08-24 15:03:08,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:03:08,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-08-24 15:03:08,053 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 15:03:08,055 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 15:03:08,055 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 15:03:08,055 INFO L175 Difference]: Start difference. First operand has 120 places, 367 transitions, 6979 flow. Second operand 5 states and 512 transitions. [2023-08-24 15:03:08,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 435 transitions, 8419 flow [2023-08-24 15:03:09,617 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 15:03:09,623 INFO L231 Difference]: Finished difference. Result has 125 places, 371 transitions, 6671 flow [2023-08-24 15:03:09,623 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 15:03:09,623 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 87 predicate places. [2023-08-24 15:03:09,623 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 371 transitions, 6671 flow [2023-08-24 15:03:09,624 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 15:03:09,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:03:09,624 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 15:03:09,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 15:03:09,624 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 15:03:09,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:03:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1229138370, now seen corresponding path program 3 times [2023-08-24 15:03:09,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:03:09,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497866080] [2023-08-24 15:03:09,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:03:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:03:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:03:09,702 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 15:03:09,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:03:09,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497866080] [2023-08-24 15:03:09,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497866080] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:03:09,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:03:09,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:03:09,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477770520] [2023-08-24 15:03:09,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:03:09,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:03:09,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:03:09,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:03:09,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:03:09,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:03:09,705 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 15:03:09,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:03:09,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:03:09,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:03:11,971 INFO L124 PetriNetUnfolderBase]: 13753/18398 cut-off events. [2023-08-24 15:03:11,971 INFO L125 PetriNetUnfolderBase]: For 331776/333997 co-relation queries the response was YES. [2023-08-24 15:03:12,032 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 15:03:12,119 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 454 selfloop transitions, 25 changer transitions 25/520 dead transitions. [2023-08-24 15:03:12,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 520 transitions, 9598 flow [2023-08-24 15:03:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:03:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:03:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2023-08-24 15:03:12,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2023-08-24 15:03:12,121 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2023-08-24 15:03:12,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2023-08-24 15:03:12,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:03:12,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2023-08-24 15:03:12,122 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 15:03:12,123 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 15:03:12,124 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 15:03:12,124 INFO L175 Difference]: Start difference. First operand has 125 places, 371 transitions, 6671 flow. Second operand 5 states and 516 transitions. [2023-08-24 15:03:12,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 520 transitions, 9598 flow [2023-08-24 15:03:13,743 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 15:03:13,748 INFO L231 Difference]: Finished difference. Result has 129 places, 376 transitions, 6398 flow [2023-08-24 15:03:13,749 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 15:03:13,749 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 91 predicate places. [2023-08-24 15:03:13,749 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 376 transitions, 6398 flow [2023-08-24 15:03:13,749 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 15:03:13,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:03:13,750 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 15:03:13,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 15:03:13,750 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 15:03:13,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:03:13,750 INFO L85 PathProgramCache]: Analyzing trace with hash -505466806, now seen corresponding path program 5 times [2023-08-24 15:03:13,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:03:13,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919177609] [2023-08-24 15:03:13,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:03:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:03:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:03:13,804 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 15:03:13,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:03:13,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919177609] [2023-08-24 15:03:13,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919177609] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:03:13,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:03:13,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:03:13,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394130161] [2023-08-24 15:03:13,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:03:13,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:03:13,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:03:13,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:03:13,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:03:13,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:03:13,807 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 15:03:13,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:03:13,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:03:13,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:03:15,940 INFO L124 PetriNetUnfolderBase]: 13896/18470 cut-off events. [2023-08-24 15:03:15,941 INFO L125 PetriNetUnfolderBase]: For 325825/328472 co-relation queries the response was YES. [2023-08-24 15:03:15,998 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 15:03:16,067 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 385 selfloop transitions, 56 changer transitions 4/461 dead transitions. [2023-08-24 15:03:16,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 461 transitions, 8092 flow [2023-08-24 15:03:16,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:03:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:03:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-24 15:03:16,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-08-24 15:03:16,069 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-24 15:03:16,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-24 15:03:16,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:03:16,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-24 15:03:16,070 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 15:03:16,071 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 15:03:16,071 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 15:03:16,072 INFO L175 Difference]: Start difference. First operand has 129 places, 376 transitions, 6398 flow. Second operand 5 states and 507 transitions. [2023-08-24 15:03:16,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 461 transitions, 8092 flow [2023-08-24 15:03:17,804 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 15:03:17,812 INFO L231 Difference]: Finished difference. Result has 131 places, 377 transitions, 6431 flow [2023-08-24 15:03:17,812 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 15:03:17,813 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 93 predicate places. [2023-08-24 15:03:17,813 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 377 transitions, 6431 flow [2023-08-24 15:03:17,813 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 15:03:17,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:03:17,813 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 15:03:17,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-24 15:03:17,813 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 15:03:17,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:03:17,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1895011962, now seen corresponding path program 4 times [2023-08-24 15:03:17,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:03:17,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195668361] [2023-08-24 15:03:17,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:03:17,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:03:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:03:17,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 15:03:17,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:03:17,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195668361] [2023-08-24 15:03:17,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195668361] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:03:17,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:03:17,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:03:17,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341408399] [2023-08-24 15:03:17,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:03:17,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:03:17,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:03:17,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:03:17,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:03:17,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:03:17,887 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 15:03:17,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:03:17,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:03:17,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:03:20,152 INFO L124 PetriNetUnfolderBase]: 14952/20192 cut-off events. [2023-08-24 15:03:20,152 INFO L125 PetriNetUnfolderBase]: For 294627/296084 co-relation queries the response was YES. [2023-08-24 15:03:20,247 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 15:03:20,327 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 147 selfloop transitions, 276 changer transitions 10/444 dead transitions. [2023-08-24 15:03:20,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 444 transitions, 7886 flow [2023-08-24 15:03:20,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:03:20,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:03:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2023-08-24 15:03:20,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2023-08-24 15:03:20,334 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2023-08-24 15:03:20,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2023-08-24 15:03:20,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:03:20,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2023-08-24 15:03:20,335 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 15:03:20,337 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 15:03:20,337 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 15:03:20,337 INFO L175 Difference]: Start difference. First operand has 131 places, 377 transitions, 6431 flow. Second operand 5 states and 516 transitions. [2023-08-24 15:03:20,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 444 transitions, 7886 flow [2023-08-24 15:03:22,821 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 15:03:22,827 INFO L231 Difference]: Finished difference. Result has 135 places, 377 transitions, 7149 flow [2023-08-24 15:03:22,828 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 15:03:22,828 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 97 predicate places. [2023-08-24 15:03:22,828 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 377 transitions, 7149 flow [2023-08-24 15:03:22,828 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 15:03:22,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:03:22,828 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 15:03:22,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-24 15:03:22,829 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 15:03:22,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:03:22,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1196799427, now seen corresponding path program 5 times [2023-08-24 15:03:22,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:03:22,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107516708] [2023-08-24 15:03:22,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:03:22,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:03:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:03:22,888 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 15:03:22,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:03:22,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107516708] [2023-08-24 15:03:22,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107516708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:03:22,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:03:22,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:03:22,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074652606] [2023-08-24 15:03:22,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:03:22,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:03:22,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:03:22,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:03:22,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:03:22,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:03:22,891 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 15:03:22,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:03:22,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:03:22,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:03:25,582 INFO L124 PetriNetUnfolderBase]: 17005/22648 cut-off events. [2023-08-24 15:03:25,583 INFO L125 PetriNetUnfolderBase]: For 445231/449454 co-relation queries the response was YES. [2023-08-24 15:03:25,693 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 15:03:25,808 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 468 selfloop transitions, 58 changer transitions 16/566 dead transitions. [2023-08-24 15:03:25,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 566 transitions, 11089 flow [2023-08-24 15:03:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:03:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:03:25,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2023-08-24 15:03:25,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2023-08-24 15:03:25,810 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2023-08-24 15:03:25,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2023-08-24 15:03:25,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:03:25,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2023-08-24 15:03:25,812 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 15:03:25,813 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 15:03:25,813 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 15:03:25,813 INFO L175 Difference]: Start difference. First operand has 135 places, 377 transitions, 7149 flow. Second operand 5 states and 505 transitions. [2023-08-24 15:03:25,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 566 transitions, 11089 flow [2023-08-24 15:03:28,754 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 15:03:28,760 INFO L231 Difference]: Finished difference. Result has 140 places, 415 transitions, 7519 flow [2023-08-24 15:03:28,760 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 15:03:28,761 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 102 predicate places. [2023-08-24 15:03:28,761 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 415 transitions, 7519 flow [2023-08-24 15:03:28,761 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 15:03:28,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:03:28,761 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 15:03:28,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-24 15:03:28,761 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 15:03:28,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:03:28,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1131469262, now seen corresponding path program 5 times [2023-08-24 15:03:28,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:03:28,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698381066] [2023-08-24 15:03:28,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:03:28,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:03:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:03:28,817 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 15:03:28,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:03:28,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698381066] [2023-08-24 15:03:28,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698381066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:03:28,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:03:28,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:03:28,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866864994] [2023-08-24 15:03:28,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:03:28,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:03:28,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:03:28,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:03:28,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:03:28,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:03:28,820 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 15:03:28,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:03:28,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:03:28,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:03:32,010 INFO L124 PetriNetUnfolderBase]: 16965/22655 cut-off events. [2023-08-24 15:03:32,010 INFO L125 PetriNetUnfolderBase]: For 474786/478224 co-relation queries the response was YES. [2023-08-24 15:03:32,134 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 15:03:32,247 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 457 selfloop transitions, 57 changer transitions 0/535 dead transitions. [2023-08-24 15:03:32,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 535 transitions, 10011 flow [2023-08-24 15:03:32,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:03:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:03:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-24 15:03:32,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847619047619048 [2023-08-24 15:03:32,249 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-24 15:03:32,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-24 15:03:32,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:03:32,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-24 15:03:32,250 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 15:03:32,251 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 15:03:32,252 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 15:03:32,252 INFO L175 Difference]: Start difference. First operand has 140 places, 415 transitions, 7519 flow. Second operand 5 states and 509 transitions. [2023-08-24 15:03:32,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 535 transitions, 10011 flow [2023-08-24 15:03:34,974 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 15:03:34,981 INFO L231 Difference]: Finished difference. Result has 143 places, 416 transitions, 7561 flow [2023-08-24 15:03:34,982 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 15:03:34,982 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 105 predicate places. [2023-08-24 15:03:34,982 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 416 transitions, 7561 flow [2023-08-24 15:03:34,982 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 15:03:34,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:03:34,982 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 15:03:34,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-24 15:03:34,982 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 15:03:34,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:03:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash -586489875, now seen corresponding path program 6 times [2023-08-24 15:03:34,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:03:34,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127393206] [2023-08-24 15:03:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:03:34,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:03:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:03:35,065 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 15:03:35,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:03:35,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127393206] [2023-08-24 15:03:35,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127393206] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:03:35,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:03:35,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:03:35,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767648872] [2023-08-24 15:03:35,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:03:35,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:03:35,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:03:35,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:03:35,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:03:35,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:03:35,068 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 15:03:35,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:03:35,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:03:35,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:03:40,638 INFO L124 PetriNetUnfolderBase]: 22715/30267 cut-off events. [2023-08-24 15:03:40,638 INFO L125 PetriNetUnfolderBase]: For 618156/622905 co-relation queries the response was YES. [2023-08-24 15:03:40,753 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 15:03:40,882 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 741 selfloop transitions, 63 changer transitions 25/853 dead transitions. [2023-08-24 15:03:40,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 853 transitions, 17110 flow [2023-08-24 15:03:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:03:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:03:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-08-24 15:03:40,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819047619047619 [2023-08-24 15:03:40,884 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-08-24 15:03:40,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-08-24 15:03:40,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:03:40,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-08-24 15:03:40,885 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 15:03:40,886 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 15:03:40,887 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 15:03:40,887 INFO L175 Difference]: Start difference. First operand has 143 places, 416 transitions, 7561 flow. Second operand 5 states and 506 transitions. [2023-08-24 15:03:40,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 853 transitions, 17110 flow [2023-08-24 15:03:45,044 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 15:03:45,052 INFO L231 Difference]: Finished difference. Result has 148 places, 427 transitions, 7941 flow [2023-08-24 15:03:45,053 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 15:03:45,053 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 110 predicate places. [2023-08-24 15:03:45,053 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 427 transitions, 7941 flow [2023-08-24 15:03:45,053 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 15:03:45,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:03:45,053 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 15:03:45,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-24 15:03:45,053 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 15:03:45,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:03:45,054 INFO L85 PathProgramCache]: Analyzing trace with hash -348828861, now seen corresponding path program 7 times [2023-08-24 15:03:45,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:03:45,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957574523] [2023-08-24 15:03:45,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:03:45,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:03:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:03:45,214 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 15:03:45,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:03:45,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957574523] [2023-08-24 15:03:45,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957574523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:03:45,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:03:45,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:03:45,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311344803] [2023-08-24 15:03:45,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:03:45,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:03:45,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:03:45,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:03:45,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:03:45,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:03:45,218 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 15:03:45,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:03:45,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:03:45,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:03:47,625 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 15:03:47,626 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 15:03:47,626 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:03:47,626 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:03:47,626 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:03:48,036 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 15:03:48,036 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 15:03:48,036 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:03:48,036 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:03:48,036 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:03:48,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][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 15:03:48,575 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-24 15:03:48,575 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 15:03:48,575 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 15:03:48,575 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 15:03:48,801 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 15:03:48,801 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-24 15:03:48,801 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 15:03:48,801 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 15:03:48,801 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 15:03:49,213 INFO L124 PetriNetUnfolderBase]: 21850/29321 cut-off events. [2023-08-24 15:03:49,213 INFO L125 PetriNetUnfolderBase]: For 672575/676174 co-relation queries the response was YES. [2023-08-24 15:03:49,372 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 15:03:49,696 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 205 selfloop transitions, 280 changer transitions 8/515 dead transitions. [2023-08-24 15:03:49,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 515 transitions, 10138 flow [2023-08-24 15:03:49,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:03:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:03:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-08-24 15:03:49,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-08-24 15:03:49,698 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-08-24 15:03:49,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-08-24 15:03:49,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:03:49,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-08-24 15:03:49,699 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 15:03:49,700 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 15:03:49,700 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 15:03:49,700 INFO L175 Difference]: Start difference. First operand has 148 places, 427 transitions, 7941 flow. Second operand 5 states and 510 transitions. [2023-08-24 15:03:49,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 515 transitions, 10138 flow [2023-08-24 15:03:53,214 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 15:03:53,221 INFO L231 Difference]: Finished difference. Result has 153 places, 433 transitions, 8590 flow [2023-08-24 15:03:53,221 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 15:03:53,221 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 115 predicate places. [2023-08-24 15:03:53,221 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 433 transitions, 8590 flow [2023-08-24 15:03:53,222 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 15:03:53,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:03:53,222 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 15:03:53,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-24 15:03:53,222 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 15:03:53,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:03:53,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2143608274, now seen corresponding path program 6 times [2023-08-24 15:03:53,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:03:53,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435850125] [2023-08-24 15:03:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:03:53,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:03:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:03:53,275 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 15:03:53,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:03:53,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435850125] [2023-08-24 15:03:53,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435850125] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:03:53,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:03:53,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:03:53,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013256858] [2023-08-24 15:03:53,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:03:53,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:03:53,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:03:53,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:03:53,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:03:53,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:03:53,277 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 15:03:53,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:03:53,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:03:53,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:03:57,601 INFO L124 PetriNetUnfolderBase]: 22601/30152 cut-off events. [2023-08-24 15:03:57,601 INFO L125 PetriNetUnfolderBase]: For 710369/714636 co-relation queries the response was YES. [2023-08-24 15:03:57,733 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 15:03:57,852 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 411 selfloop transitions, 87 changer transitions 2/522 dead transitions. [2023-08-24 15:03:57,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 522 transitions, 10636 flow [2023-08-24 15:03:57,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:03:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:03:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2023-08-24 15:03:57,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2023-08-24 15:03:57,853 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2023-08-24 15:03:57,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2023-08-24 15:03:57,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:03:57,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2023-08-24 15:03:57,854 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 15:03:57,856 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 15:03:57,856 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 15:03:57,856 INFO L175 Difference]: Start difference. First operand has 153 places, 433 transitions, 8590 flow. Second operand 5 states and 505 transitions. [2023-08-24 15:03:57,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 522 transitions, 10636 flow [2023-08-24 15:04:00,694 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 15:04:00,705 INFO L231 Difference]: Finished difference. Result has 155 places, 435 transitions, 8253 flow [2023-08-24 15:04:00,705 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 15:04:00,705 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 117 predicate places. [2023-08-24 15:04:00,706 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 435 transitions, 8253 flow [2023-08-24 15:04:00,706 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 15:04:00,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:04:00,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 15:04:00,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-24 15:04:00,707 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 15:04:00,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:04:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash -539745269, now seen corresponding path program 6 times [2023-08-24 15:04:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:04:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81259912] [2023-08-24 15:04:00,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:04:00,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:04:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:04:00,768 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 15:04:00,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:04:00,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81259912] [2023-08-24 15:04:00,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81259912] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:04:00,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:04:00,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:04:00,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517632815] [2023-08-24 15:04:00,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:04:00,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:04:00,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:04:00,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:04:00,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:04:00,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:04:00,769 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 15:04:00,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:04:00,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:04:00,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:04:05,273 INFO L124 PetriNetUnfolderBase]: 23131/30987 cut-off events. [2023-08-24 15:04:05,273 INFO L125 PetriNetUnfolderBase]: For 647626/652805 co-relation queries the response was YES. [2023-08-24 15:04:05,427 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 15:04:05,546 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 621 selfloop transitions, 93 changer transitions 19/757 dead transitions. [2023-08-24 15:04:05,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 757 transitions, 15713 flow [2023-08-24 15:04:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:04:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:04:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2023-08-24 15:04:05,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2023-08-24 15:04:05,547 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2023-08-24 15:04:05,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2023-08-24 15:04:05,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:04:05,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2023-08-24 15:04:05,548 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 15:04:05,549 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 15:04:05,549 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 15:04:05,549 INFO L175 Difference]: Start difference. First operand has 155 places, 435 transitions, 8253 flow. Second operand 5 states and 505 transitions. [2023-08-24 15:04:05,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 757 transitions, 15713 flow [2023-08-24 15:04:10,302 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 15:04:10,312 INFO L231 Difference]: Finished difference. Result has 160 places, 474 transitions, 9228 flow [2023-08-24 15:04:10,313 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 15:04:10,313 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 122 predicate places. [2023-08-24 15:04:10,313 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 474 transitions, 9228 flow [2023-08-24 15:04:10,313 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 15:04:10,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:04:10,313 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 15:04:10,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-24 15:04:10,314 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 15:04:10,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:04:10,314 INFO L85 PathProgramCache]: Analyzing trace with hash 671135343, now seen corresponding path program 7 times [2023-08-24 15:04:10,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:04:10,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003693038] [2023-08-24 15:04:10,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:04:10,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:04:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:04:10,379 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 15:04:10,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:04:10,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003693038] [2023-08-24 15:04:10,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003693038] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:04:10,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:04:10,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:04:10,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625724975] [2023-08-24 15:04:10,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:04:10,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:04:10,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:04:10,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:04:10,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:04:10,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:04:10,384 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 15:04:10,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:04:10,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:04:10,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:04:15,231 INFO L124 PetriNetUnfolderBase]: 24136/32352 cut-off events. [2023-08-24 15:04:15,231 INFO L125 PetriNetUnfolderBase]: For 697632/702543 co-relation queries the response was YES. [2023-08-24 15:04:15,399 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 15:04:15,525 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 744 selfloop transitions, 79 changer transitions 28/875 dead transitions. [2023-08-24 15:04:15,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 875 transitions, 18431 flow [2023-08-24 15:04:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:04:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:04:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-08-24 15:04:15,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838095238095238 [2023-08-24 15:04:15,526 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-08-24 15:04:15,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-08-24 15:04:15,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:04:15,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-08-24 15:04:15,527 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 15:04:15,528 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 15:04:15,529 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 15:04:15,529 INFO L175 Difference]: Start difference. First operand has 160 places, 474 transitions, 9228 flow. Second operand 5 states and 508 transitions. [2023-08-24 15:04:15,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 875 transitions, 18431 flow [2023-08-24 15:04:21,975 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 15:04:21,987 INFO L231 Difference]: Finished difference. Result has 164 places, 480 transitions, 9274 flow [2023-08-24 15:04:21,988 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 15:04:21,988 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 126 predicate places. [2023-08-24 15:04:21,988 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 480 transitions, 9274 flow [2023-08-24 15:04:21,988 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 15:04:21,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:04:21,988 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 15:04:21,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-24 15:04:21,989 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 15:04:21,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:04:21,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1969810878, now seen corresponding path program 7 times [2023-08-24 15:04:21,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:04:21,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900039526] [2023-08-24 15:04:21,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:04:21,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:04:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:04:22,046 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 15:04:22,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:04:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900039526] [2023-08-24 15:04:22,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900039526] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:04:22,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:04:22,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:04:22,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095514026] [2023-08-24 15:04:22,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:04:22,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:04:22,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:04:22,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:04:22,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:04:22,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:04:22,049 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 15:04:22,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:04:22,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:04:22,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:04:27,127 INFO L124 PetriNetUnfolderBase]: 23640/32066 cut-off events. [2023-08-24 15:04:27,127 INFO L125 PetriNetUnfolderBase]: For 707721/710073 co-relation queries the response was YES. [2023-08-24 15:04:27,306 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 15:04:27,626 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 750 selfloop transitions, 79 changer transitions 61/915 dead transitions. [2023-08-24 15:04:27,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 915 transitions, 19209 flow [2023-08-24 15:04:27,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:04:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:04:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-08-24 15:04:27,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-08-24 15:04:27,628 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-08-24 15:04:27,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-08-24 15:04:27,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:04:27,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-08-24 15:04:27,629 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 15:04:27,630 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 15:04:27,630 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 15:04:27,630 INFO L175 Difference]: Start difference. First operand has 164 places, 480 transitions, 9274 flow. Second operand 5 states and 510 transitions. [2023-08-24 15:04:27,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 915 transitions, 19209 flow [2023-08-24 15:04:33,934 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 15:04:33,944 INFO L231 Difference]: Finished difference. Result has 168 places, 488 transitions, 9765 flow [2023-08-24 15:04:33,944 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 15:04:33,945 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 130 predicate places. [2023-08-24 15:04:33,945 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 488 transitions, 9765 flow [2023-08-24 15:04:33,945 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 15:04:33,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:04:33,945 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 15:04:33,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-24 15:04:33,945 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 15:04:33,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:04:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1749286269, now seen corresponding path program 8 times [2023-08-24 15:04:33,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:04:33,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298268550] [2023-08-24 15:04:33,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:04:33,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:04:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:04:33,996 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 15:04:33,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:04:33,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298268550] [2023-08-24 15:04:33,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298268550] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:04:33,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:04:33,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:04:33,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567563624] [2023-08-24 15:04:33,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:04:33,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:04:33,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:04:33,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:04:33,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:04:33,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:04:33,999 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 15:04:33,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:04:33,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:04:33,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:04:39,095 INFO L124 PetriNetUnfolderBase]: 25224/33693 cut-off events. [2023-08-24 15:04:39,095 INFO L125 PetriNetUnfolderBase]: For 838320/843891 co-relation queries the response was YES. [2023-08-24 15:04:39,272 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 15:04:39,403 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 484 selfloop transitions, 103 changer transitions 8/621 dead transitions. [2023-08-24 15:04:39,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 621 transitions, 13082 flow [2023-08-24 15:04:39,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:04:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:04:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-08-24 15:04:39,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47714285714285715 [2023-08-24 15:04:39,404 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-08-24 15:04:39,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-08-24 15:04:39,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:04:39,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-08-24 15:04:39,405 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 15:04:39,406 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 15:04:39,406 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 15:04:39,406 INFO L175 Difference]: Start difference. First operand has 168 places, 488 transitions, 9765 flow. Second operand 5 states and 501 transitions. [2023-08-24 15:04:39,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 621 transitions, 13082 flow [2023-08-24 15:04:45,874 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 15:04:45,883 INFO L231 Difference]: Finished difference. Result has 170 places, 493 transitions, 9760 flow [2023-08-24 15:04:45,883 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 15:04:45,889 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 132 predicate places. [2023-08-24 15:04:45,889 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 493 transitions, 9760 flow [2023-08-24 15:04:45,889 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 15:04:45,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:04:45,889 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 15:04:45,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-24 15:04:45,889 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 15:04:45,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:04:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1717977964, now seen corresponding path program 8 times [2023-08-24 15:04:45,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:04:45,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883358138] [2023-08-24 15:04:45,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:04:45,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:04:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:04:45,940 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 15:04:45,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:04:45,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883358138] [2023-08-24 15:04:45,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883358138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:04:45,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:04:45,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:04:45,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570552024] [2023-08-24 15:04:45,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:04:45,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:04:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:04:45,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:04:45,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:04:45,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:04:45,942 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 15:04:45,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:04:45,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:04:45,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:04:49,027 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 15:04:49,027 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-24 15:04:49,027 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:04:49,027 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:04:49,027 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-24 15:04:49,824 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 15:04:49,824 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-24 15:04:49,824 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:04:49,824 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:04:49,824 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-24 15:04:50,198 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 15:04:50,199 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-24 15:04:50,199 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 15:04:50,199 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 15:04:50,199 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-24 15:04:50,710 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 15:04:50,710 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-24 15:04:50,710 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 15:04:50,710 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 15:04:50,710 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-24 15:04:51,142 INFO L124 PetriNetUnfolderBase]: 24809/33446 cut-off events. [2023-08-24 15:04:51,142 INFO L125 PetriNetUnfolderBase]: For 826274/830560 co-relation queries the response was YES. [2023-08-24 15:04:51,302 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 15:04:51,429 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 491 selfloop transitions, 92 changer transitions 26/630 dead transitions. [2023-08-24 15:04:51,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 630 transitions, 13017 flow [2023-08-24 15:04:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:04:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:04:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-24 15:04:51,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2023-08-24 15:04:51,431 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-24 15:04:51,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-24 15:04:51,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:04:51,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-24 15:04:51,432 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 15:04:51,433 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 15:04:51,433 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 15:04:51,433 INFO L175 Difference]: Start difference. First operand has 170 places, 493 transitions, 9760 flow. Second operand 5 states and 518 transitions. [2023-08-24 15:04:51,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 630 transitions, 13017 flow [2023-08-24 15:04:57,025 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 15:04:57,033 INFO L231 Difference]: Finished difference. Result has 173 places, 500 transitions, 10021 flow [2023-08-24 15:04:57,033 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 15:04:57,034 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 135 predicate places. [2023-08-24 15:04:57,034 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 500 transitions, 10021 flow [2023-08-24 15:04:57,034 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 15:04:57,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:04:57,034 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 15:04:57,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-24 15:04:57,035 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 15:04:57,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:04:57,035 INFO L85 PathProgramCache]: Analyzing trace with hash -538516104, now seen corresponding path program 9 times [2023-08-24 15:04:57,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:04:57,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375980301] [2023-08-24 15:04:57,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:04:57,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:04:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:04:57,088 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 15:04:57,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:04:57,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375980301] [2023-08-24 15:04:57,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375980301] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:04:57,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:04:57,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:04:57,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939894316] [2023-08-24 15:04:57,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:04:57,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:04:57,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:04:57,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:04:57,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:04:57,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:04:57,090 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 15:04:57,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:04:57,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:04:57,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:05:02,286 INFO L124 PetriNetUnfolderBase]: 24036/32456 cut-off events. [2023-08-24 15:05:02,286 INFO L125 PetriNetUnfolderBase]: For 803888/807881 co-relation queries the response was YES. [2023-08-24 15:05:02,457 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 15:05:02,576 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 566 selfloop transitions, 63 changer transitions 61/720 dead transitions. [2023-08-24 15:05:02,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 720 transitions, 15153 flow [2023-08-24 15:05:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:05:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:05:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-24 15:05:02,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847619047619048 [2023-08-24 15:05:02,578 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-24 15:05:02,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-24 15:05:02,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:05:02,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-24 15:05:02,578 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 15:05:02,579 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 15:05:02,579 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 15:05:02,579 INFO L175 Difference]: Start difference. First operand has 173 places, 500 transitions, 10021 flow. Second operand 5 states and 509 transitions. [2023-08-24 15:05:02,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 720 transitions, 15153 flow [2023-08-24 15:05:08,077 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 15:05:08,086 INFO L231 Difference]: Finished difference. Result has 176 places, 484 transitions, 9699 flow [2023-08-24 15:05:08,086 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 15:05:08,086 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 138 predicate places. [2023-08-24 15:05:08,086 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 484 transitions, 9699 flow [2023-08-24 15:05:08,087 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 15:05:08,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:05:08,087 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 15:05:08,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-24 15:05:08,087 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 15:05:08,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:05:08,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2110712002, now seen corresponding path program 6 times [2023-08-24 15:05:08,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:05:08,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628331519] [2023-08-24 15:05:08,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:05:08,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:05:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:05:08,141 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 15:05:08,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:05:08,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628331519] [2023-08-24 15:05:08,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628331519] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:05:08,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:05:08,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:05:08,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209051970] [2023-08-24 15:05:08,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:05:08,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:05:08,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:05:08,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:05:08,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:05:08,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:05:08,144 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 15:05:08,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:05:08,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:05:08,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:05:13,846 INFO L124 PetriNetUnfolderBase]: 26456/35657 cut-off events. [2023-08-24 15:05:13,846 INFO L125 PetriNetUnfolderBase]: For 831159/833821 co-relation queries the response was YES. [2023-08-24 15:05:14,066 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 15:05:14,204 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 650 selfloop transitions, 111 changer transitions 48/849 dead transitions. [2023-08-24 15:05:14,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 849 transitions, 18332 flow [2023-08-24 15:05:14,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:05:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:05:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-08-24 15:05:14,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47904761904761906 [2023-08-24 15:05:14,205 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-08-24 15:05:14,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-08-24 15:05:14,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:05:14,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-08-24 15:05:14,206 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 15:05:14,207 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 15:05:14,207 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 15:05:14,207 INFO L175 Difference]: Start difference. First operand has 176 places, 484 transitions, 9699 flow. Second operand 5 states and 503 transitions. [2023-08-24 15:05:14,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 849 transitions, 18332 flow [2023-08-24 15:05:21,888 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 15:05:21,897 INFO L231 Difference]: Finished difference. Result has 180 places, 538 transitions, 10813 flow [2023-08-24 15:05:21,898 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 15:05:21,898 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2023-08-24 15:05:21,898 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 538 transitions, 10813 flow [2023-08-24 15:05:21,898 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 15:05:21,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:05:21,898 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 15:05:21,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-24 15:05:21,899 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 15:05:21,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:05:21,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1856399286, now seen corresponding path program 10 times [2023-08-24 15:05:21,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:05:21,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934297608] [2023-08-24 15:05:21,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:05:21,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:05:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:05:21,959 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 15:05:21,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:05:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934297608] [2023-08-24 15:05:21,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934297608] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:05:21,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:05:21,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:05:21,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740272755] [2023-08-24 15:05:21,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:05:21,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:05:21,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:05:21,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:05:21,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:05:21,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:05:21,962 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 15:05:21,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:05:21,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:05:21,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:05:28,119 INFO L124 PetriNetUnfolderBase]: 26211/35883 cut-off events. [2023-08-24 15:05:28,119 INFO L125 PetriNetUnfolderBase]: For 888802/890876 co-relation queries the response was YES. [2023-08-24 15:05:28,320 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 15:05:28,447 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 268 selfloop transitions, 326 changer transitions 38/660 dead transitions. [2023-08-24 15:05:28,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 660 transitions, 14032 flow [2023-08-24 15:05:28,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:05:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:05:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-24 15:05:28,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-08-24 15:05:28,448 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-24 15:05:28,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-24 15:05:28,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:05:28,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-24 15:05:28,449 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 15:05:28,450 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 15:05:28,450 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 15:05:28,450 INFO L175 Difference]: Start difference. First operand has 180 places, 538 transitions, 10813 flow. Second operand 5 states and 507 transitions. [2023-08-24 15:05:28,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 660 transitions, 14032 flow [2023-08-24 15:05:36,314 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 15:05:36,325 INFO L231 Difference]: Finished difference. Result has 183 places, 543 transitions, 11498 flow [2023-08-24 15:05:36,325 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 15:05:36,325 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 145 predicate places. [2023-08-24 15:05:36,325 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 543 transitions, 11498 flow [2023-08-24 15:05:36,325 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 15:05:36,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:05:36,326 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 15:05:36,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-24 15:05:36,326 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 15:05:36,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:05:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash 772963800, now seen corresponding path program 7 times [2023-08-24 15:05:36,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:05:36,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385794995] [2023-08-24 15:05:36,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:05:36,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:05:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:05:36,372 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 15:05:36,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:05:36,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385794995] [2023-08-24 15:05:36,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385794995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:05:36,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:05:36,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:05:36,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676081342] [2023-08-24 15:05:36,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:05:36,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:05:36,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:05:36,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:05:36,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:05:36,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:05:36,374 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 15:05:36,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:05:36,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:05:36,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:05:42,279 INFO L124 PetriNetUnfolderBase]: 27084/36936 cut-off events. [2023-08-24 15:05:42,279 INFO L125 PetriNetUnfolderBase]: For 959673/962838 co-relation queries the response was YES. [2023-08-24 15:05:42,487 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 15:05:42,612 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 783 selfloop transitions, 92 changer transitions 60/972 dead transitions. [2023-08-24 15:05:42,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 972 transitions, 22422 flow [2023-08-24 15:05:42,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:05:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:05:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-08-24 15:05:42,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838095238095238 [2023-08-24 15:05:42,613 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-08-24 15:05:42,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-08-24 15:05:42,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:05:42,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-08-24 15:05:42,614 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 15:05:42,615 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 15:05:42,615 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 15:05:42,615 INFO L175 Difference]: Start difference. First operand has 183 places, 543 transitions, 11498 flow. Second operand 5 states and 508 transitions. [2023-08-24 15:05:42,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 972 transitions, 22422 flow [2023-08-24 15:05:50,436 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 15:05:50,447 INFO L231 Difference]: Finished difference. Result has 186 places, 541 transitions, 11030 flow [2023-08-24 15:05:50,447 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 15:05:50,448 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 148 predicate places. [2023-08-24 15:05:50,448 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 541 transitions, 11030 flow [2023-08-24 15:05:50,448 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 15:05:50,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:05:50,448 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 15:05:50,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-24 15:05:50,448 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 15:05:50,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:05:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1690867288, now seen corresponding path program 8 times [2023-08-24 15:05:50,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:05:50,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945728859] [2023-08-24 15:05:50,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:05:50,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:05:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:05:50,498 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 15:05:50,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:05:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945728859] [2023-08-24 15:05:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945728859] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:05:50,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:05:50,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:05:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631228642] [2023-08-24 15:05:50,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:05:50,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:05:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:05:50,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:05:50,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:05:50,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:05:50,500 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 15:05:50,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:05:50,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:05:50,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:05:57,299 INFO L124 PetriNetUnfolderBase]: 29598/40090 cut-off events. [2023-08-24 15:05:57,299 INFO L125 PetriNetUnfolderBase]: For 1138498/1142646 co-relation queries the response was YES. [2023-08-24 15:05:57,515 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 15:05:57,651 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 528 selfloop transitions, 161 changer transitions 36/759 dead transitions. [2023-08-24 15:05:57,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 759 transitions, 16289 flow [2023-08-24 15:05:57,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:05:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:05:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-24 15:05:57,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847619047619048 [2023-08-24 15:05:57,652 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-24 15:05:57,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-24 15:05:57,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:05:57,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-24 15:05:57,653 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 15:05:57,654 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 15:05:57,654 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 15:05:57,654 INFO L175 Difference]: Start difference. First operand has 186 places, 541 transitions, 11030 flow. Second operand 5 states and 509 transitions. [2023-08-24 15:05:57,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 759 transitions, 16289 flow [2023-08-24 15:06:05,525 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 15:06:05,535 INFO L231 Difference]: Finished difference. Result has 189 places, 628 transitions, 13125 flow [2023-08-24 15:06:05,535 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 15:06:05,535 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 151 predicate places. [2023-08-24 15:06:05,535 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 628 transitions, 13125 flow [2023-08-24 15:06:05,535 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 15:06:05,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:06:05,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:06:05,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-24 15:06:05,536 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 15:06:05,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:06:05,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1339221760, now seen corresponding path program 9 times [2023-08-24 15:06:05,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:06:05,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260837552] [2023-08-24 15:06:05,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:06:05,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:06:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:06:05,582 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 15:06:05,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:06:05,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260837552] [2023-08-24 15:06:05,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260837552] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:06:05,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:06:05,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:06:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531666229] [2023-08-24 15:06:05,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:06:05,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:06:05,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:06:05,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:06:05,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:06:05,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:06:05,584 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 15:06:05,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:06:05,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:06:05,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:06:12,456 INFO L124 PetriNetUnfolderBase]: 28486/38902 cut-off events. [2023-08-24 15:06:12,456 INFO L125 PetriNetUnfolderBase]: For 1112615/1116377 co-relation queries the response was YES. [2023-08-24 15:06:12,682 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 15:06:12,822 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 393 selfloop transitions, 326 changer transitions 37/785 dead transitions. [2023-08-24 15:06:12,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 785 transitions, 17580 flow [2023-08-24 15:06:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:06:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:06:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-24 15:06:12,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-08-24 15:06:12,823 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-24 15:06:12,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-24 15:06:12,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:06:12,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-24 15:06:12,824 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 15:06:12,825 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 15:06:12,825 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 15:06:12,825 INFO L175 Difference]: Start difference. First operand has 189 places, 628 transitions, 13125 flow. Second operand 5 states and 507 transitions. [2023-08-24 15:06:12,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 785 transitions, 17580 flow [2023-08-24 15:06:21,647 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 15:06:21,662 INFO L231 Difference]: Finished difference. Result has 193 places, 634 transitions, 13766 flow [2023-08-24 15:06:21,662 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 15:06:21,662 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 155 predicate places. [2023-08-24 15:06:21,663 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 634 transitions, 13766 flow [2023-08-24 15:06:21,663 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 15:06:21,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:06:21,663 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 15:06:21,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-24 15:06:21,663 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 15:06:21,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:06:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1864656116, now seen corresponding path program 10 times [2023-08-24 15:06:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:06:21,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386265763] [2023-08-24 15:06:21,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:06:21,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:06:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:06:21,716 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 15:06:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:06:21,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386265763] [2023-08-24 15:06:21,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386265763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:06:21,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:06:21,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:06:21,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083220545] [2023-08-24 15:06:21,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:06:21,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:06:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:06:21,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:06:21,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:06:21,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:06:21,718 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 15:06:21,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:06:21,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:06:21,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:06:29,312 INFO L124 PetriNetUnfolderBase]: 30870/41853 cut-off events. [2023-08-24 15:06:29,313 INFO L125 PetriNetUnfolderBase]: For 1271678/1276350 co-relation queries the response was YES. [2023-08-24 15:06:29,602 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 15:06:29,755 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 568 selfloop transitions, 180 changer transitions 12/794 dead transitions. [2023-08-24 15:06:29,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 794 transitions, 18153 flow [2023-08-24 15:06:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:06:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:06:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-24 15:06:29,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847619047619048 [2023-08-24 15:06:29,757 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-24 15:06:29,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-24 15:06:29,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:06:29,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-24 15:06:29,758 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 15:06:29,760 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 15:06:29,760 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 15:06:29,760 INFO L175 Difference]: Start difference. First operand has 193 places, 634 transitions, 13766 flow. Second operand 5 states and 509 transitions. [2023-08-24 15:06:29,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 794 transitions, 18153 flow [2023-08-24 15:06:40,039 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 15:06:40,049 INFO L231 Difference]: Finished difference. Result has 194 places, 655 transitions, 13786 flow [2023-08-24 15:06:40,050 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 15:06:40,050 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 156 predicate places. [2023-08-24 15:06:40,050 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 655 transitions, 13786 flow [2023-08-24 15:06:40,050 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 15:06:40,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:06:40,050 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 15:06:40,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-24 15:06:40,051 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 15:06:40,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:06:40,051 INFO L85 PathProgramCache]: Analyzing trace with hash -584387732, now seen corresponding path program 11 times [2023-08-24 15:06:40,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:06:40,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199352410] [2023-08-24 15:06:40,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:06:40,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:06:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:06:40,099 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 15:06:40,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:06:40,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199352410] [2023-08-24 15:06:40,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199352410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:06:40,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:06:40,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:06:40,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691718812] [2023-08-24 15:06:40,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:06:40,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:06:40,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:06:40,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:06:40,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:06:40,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:06:40,102 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 15:06:40,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:06:40,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:06:40,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:06:47,773 INFO L124 PetriNetUnfolderBase]: 30662/41940 cut-off events. [2023-08-24 15:06:47,774 INFO L125 PetriNetUnfolderBase]: For 1300680/1306613 co-relation queries the response was YES. [2023-08-24 15:06:48,027 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 15:06:48,170 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 533 selfloop transitions, 176 changer transitions 35/782 dead transitions. [2023-08-24 15:06:48,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 782 transitions, 17528 flow [2023-08-24 15:06:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:06:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:06:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-24 15:06:48,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-08-24 15:06:48,171 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-24 15:06:48,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-24 15:06:48,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:06:48,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-24 15:06:48,172 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 15:06:48,173 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 15:06:48,173 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 15:06:48,173 INFO L175 Difference]: Start difference. First operand has 194 places, 655 transitions, 13786 flow. Second operand 5 states and 507 transitions. [2023-08-24 15:06:48,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 782 transitions, 17528 flow [2023-08-24 15:06:58,955 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 15:06:58,966 INFO L231 Difference]: Finished difference. Result has 197 places, 657 transitions, 14006 flow [2023-08-24 15:06:58,966 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 15:06:58,966 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 159 predicate places. [2023-08-24 15:06:58,966 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 657 transitions, 14006 flow [2023-08-24 15:06:58,967 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 15:06:58,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:06:58,967 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 15:06:58,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-08-24 15:06:58,967 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 15:06:58,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:06:58,967 INFO L85 PathProgramCache]: Analyzing trace with hash 805344777, now seen corresponding path program 8 times [2023-08-24 15:06:58,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:06:58,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400081933] [2023-08-24 15:06:58,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:06:58,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:06:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:06:59,011 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 15:06:59,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:06:59,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400081933] [2023-08-24 15:06:59,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400081933] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:06:59,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:06:59,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:06:59,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227723712] [2023-08-24 15:06:59,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:06:59,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:06:59,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:06:59,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:06:59,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:06:59,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:06:59,014 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 15:06:59,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:06:59,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:06:59,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:07:06,383 INFO L124 PetriNetUnfolderBase]: 28910/39497 cut-off events. [2023-08-24 15:07:06,383 INFO L125 PetriNetUnfolderBase]: For 1201824/1206740 co-relation queries the response was YES. [2023-08-24 15:07:06,620 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 15:07:06,752 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 351 selfloop transitions, 326 changer transitions 61/770 dead transitions. [2023-08-24 15:07:06,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 770 transitions, 17542 flow [2023-08-24 15:07:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:07:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:07:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-08-24 15:07:06,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47904761904761906 [2023-08-24 15:07:06,754 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-08-24 15:07:06,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-08-24 15:07:06,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:07:06,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-08-24 15:07:06,754 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 15:07:06,755 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 15:07:06,755 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 15:07:06,755 INFO L175 Difference]: Start difference. First operand has 197 places, 657 transitions, 14006 flow. Second operand 5 states and 503 transitions. [2023-08-24 15:07:06,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 770 transitions, 17542 flow [2023-08-24 15:07:17,022 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 15:07:17,033 INFO L231 Difference]: Finished difference. Result has 199 places, 624 transitions, 13634 flow [2023-08-24 15:07:17,033 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 15:07:17,034 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 161 predicate places. [2023-08-24 15:07:17,034 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 624 transitions, 13634 flow [2023-08-24 15:07:17,034 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 15:07:17,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:07:17,034 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 15:07:17,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-08-24 15:07:17,034 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 15:07:17,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:07:17,034 INFO L85 PathProgramCache]: Analyzing trace with hash 46312919, now seen corresponding path program 9 times [2023-08-24 15:07:17,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:07:17,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674549715] [2023-08-24 15:07:17,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:07:17,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:07:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:07:17,080 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 15:07:17,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:07:17,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674549715] [2023-08-24 15:07:17,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674549715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:07:17,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:07:17,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:07:17,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099470717] [2023-08-24 15:07:17,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:07:17,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:07:17,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:07:17,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:07:17,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:07:17,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:07:17,082 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 15:07:17,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:07:17,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:07:17,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:07:24,354 INFO L124 PetriNetUnfolderBase]: 29255/40219 cut-off events. [2023-08-24 15:07:24,355 INFO L125 PetriNetUnfolderBase]: For 1152831/1155234 co-relation queries the response was YES. [2023-08-24 15:07:24,602 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 15:07:24,739 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 623 selfloop transitions, 148 changer transitions 75/883 dead transitions. [2023-08-24 15:07:24,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 883 transitions, 20313 flow [2023-08-24 15:07:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:07:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:07:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-24 15:07:24,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-08-24 15:07:24,741 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-24 15:07:24,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-24 15:07:24,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:07:24,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-24 15:07:24,741 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 15:07:24,742 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 15:07:24,742 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 15:07:24,742 INFO L175 Difference]: Start difference. First operand has 199 places, 624 transitions, 13634 flow. Second operand 5 states and 507 transitions. [2023-08-24 15:07:24,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 883 transitions, 20313 flow [2023-08-24 15:07:35,302 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 15:07:35,314 INFO L231 Difference]: Finished difference. Result has 202 places, 678 transitions, 14673 flow [2023-08-24 15:07:35,314 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 15:07:35,314 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 164 predicate places. [2023-08-24 15:07:35,314 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 678 transitions, 14673 flow [2023-08-24 15:07:35,315 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 15:07:35,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:07:35,315 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 15:07:35,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-08-24 15:07:35,315 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 15:07:35,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:07:35,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1721037319, now seen corresponding path program 10 times [2023-08-24 15:07:35,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:07:35,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679615401] [2023-08-24 15:07:35,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:07:35,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:07:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:07:35,362 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 15:07:35,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:07:35,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679615401] [2023-08-24 15:07:35,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679615401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:07:35,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:07:35,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:07:35,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20298299] [2023-08-24 15:07:35,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:07:35,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:07:35,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:07:35,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:07:35,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:07:35,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:07:35,364 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 15:07:35,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:07:35,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:07:35,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:07:43,430 INFO L124 PetriNetUnfolderBase]: 29844/40905 cut-off events. [2023-08-24 15:07:43,430 INFO L125 PetriNetUnfolderBase]: For 1202737/1205193 co-relation queries the response was YES. [2023-08-24 15:07:43,703 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 15:07:43,842 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 662 selfloop transitions, 150 changer transitions 22/871 dead transitions. [2023-08-24 15:07:43,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 871 transitions, 19795 flow [2023-08-24 15:07:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:07:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:07:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2023-08-24 15:07:43,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2023-08-24 15:07:43,843 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2023-08-24 15:07:43,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2023-08-24 15:07:43,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:07:43,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2023-08-24 15:07:43,844 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 15:07:43,844 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 15:07:43,845 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 15:07:43,845 INFO L175 Difference]: Start difference. First operand has 202 places, 678 transitions, 14673 flow. Second operand 5 states and 505 transitions. [2023-08-24 15:07:43,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 871 transitions, 19795 flow [2023-08-24 15:07:56,189 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 15:07:56,201 INFO L231 Difference]: Finished difference. Result has 206 places, 686 transitions, 14877 flow [2023-08-24 15:07:56,201 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 15:07:56,202 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 168 predicate places. [2023-08-24 15:07:56,202 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 686 transitions, 14877 flow [2023-08-24 15:07:56,202 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 15:07:56,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:07:56,202 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 15:07:56,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-08-24 15:07:56,202 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 15:07:56,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:07:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1716797783, now seen corresponding path program 11 times [2023-08-24 15:07:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:07:56,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780413153] [2023-08-24 15:07:56,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:07:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:07:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:07:56,246 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 15:07:56,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:07:56,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780413153] [2023-08-24 15:07:56,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780413153] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:07:56,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:07:56,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 15:07:56,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904714890] [2023-08-24 15:07:56,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:07:56,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:07:56,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:07:56,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:07:56,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:07:56,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-24 15:07:56,249 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 15:07:56,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:07:56,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-24 15:07:56,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand